Skip to search formSkip to main contentSkip to account menu

Circuit Value Problem

The Circuit Value Problem (aka. the Circuit Evaluation Problem) is the computational problem of computing the output of a given Boolean circuit on a… 
Wikipedia (opens in a new tab)

Papers overview

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… 
2009
2009
Abstract.The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC3, and… 
2005
2005
We study the complexity of circuit-based combinatorial problems (e.g., the circuit value problem and the satisfiability problem… 
2004
2004
We give transparent proofs of the PTIME-completeness of two decision problems for terms in the λ-calculus. The first is a reproof… 
2003
2003
  • A. Okhotin
  • Inf. Process. Lett.
  • 2003
  • Corpus ID: 5227627
2002
2002
In this paper we show that the P-complete language of yesinstances of Circuit Value Problem under a certain supplied encoding can… 
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… 
1996
1996
This research is motivated by the Circuit Value Problem; this problem is well known to be inherently sequential. We consider… 
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…