Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying… Expand

Is this relevant?

2013

2013

AbstractWe use algorithmic tools for graphs of small treewidth to address questions in complexity theory. For our main… Expand

Is this relevant?

2012

2012

In this work we consider the problem of fast parallel evaluation of boolean circuits - namely to evaluate a boolean circuit C… Expand

Is this relevant?

2011

2011

Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem… Expand

Is this relevant?

2009

2009

Abstract.The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC3, and… Expand

Is this relevant?

2005

2005

We study the complexity of circuit-based combinatorial problems (e.g., the circuit value problem and the satisfiability problem… Expand

Is this relevant?

2002

2002

In this paper we show that the P-complete language of yesinstances of Circuit Value Problem under a certain supplied encoding can… Expand

Is this relevant?

1997

1997

Abstract. A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in the plane and that contains only AND and… Expand

Is this relevant?

1996

1996

This research is motivated by the Circuit Value Problem; this problem is well known to be inherently sequential. We consider… Expand

Is this relevant?

1994

1994

A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in the plane and that contains only AND and OR gates… Expand

Is this relevant?