Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

2016

2016

Spira showed that any Boolean formula of size s can be simulated in depth O ( log ź s ) . We generalize Spira's theorem and show… Expand

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

2005

2005

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

2004

2004

We give transparent proofs of the PTIME-completeness of two decision problems for terms in the λ-calculus. The first is a reproof… Expand

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

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

1996

1996

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

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

1993

1993

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