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)

Related topics

Related topics

7 relations
AC0Boolean circuitBoolean satisfiability problemCo-NP

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Counting Complexity by Using Partial Circuit Independency
This paper describes about complexity of NP problems by using “Effective circuit” independency, and apply SAT problem. Inputs of… 
2011
2011
The Size and Depth of Boolean Circuits : A Dissertation Proposal
In this thesis, we study the relationship between size and depth for Boolean circuits. Over four decades, very few results were… 
2007
2007
IMPROVED UPPER BOUNDS IN NC FOR MONOTONE PLANAR CIRCUIT VALUE AND SOME RESTRICTIONS AND GENERALIZATIONS
The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC, and for the… 
Review
2007
Review
2007
Computational Complexity of Dynamic Problems
This progress report surveys some of my scientiic work on part A of the Ph.D.-programme at the Computer Science Department of the… 
2004
2004
First order quantifiers in monadic second order logic
Abstract This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order… 
1987
1987
Randomised $NC$-Classes and the Probably Randomised Circuit Value Problem