Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,760,384 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
AC0
Boolean circuit
Boolean satisfiability problem
Co-NP
Expand
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
Koji M. Kobayashi
2017
Corpus ID: 196107263
This paper describes about complexity of NP problems by using “Effective circuit” independency, and apply SAT problem. Inputs of…
Expand
2016
2016
The Monotone Circuit Value Problem with Bounded Genus Is in NC
F. Abu-Khzam
,
Shouwei Li
,
C. Markarian
,
F. Heide
,
Pavel Podlipyan
International Computing and Combinatorics…
2016
Corpus ID: 26412804
We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying…
Expand
2011
2011
The Size and Depth of Boolean Circuits : A Dissertation Proposal
Jing-Tang Jang
,
A. Gál
2011
Corpus ID: 18293569
In this thesis, we study the relationship between size and depth for Boolean circuits. Over four decades, very few results were…
Expand
2009
2009
Upper Bounds for Monotone Planar Circuit Value and Variants
N. Limaye
,
M. Mahajan
,
Jayalal Sarma
Computational Complexity
2009
Corpus ID: 14221656
Abstract.The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC3, and…
Expand
2007
2007
IMPROVED UPPER BOUNDS IN NC FOR MONOTONE PLANAR CIRCUIT VALUE AND SOME RESTRICTIONS AND GENERALIZATIONS
N. Limaye
,
M. Mahajan
,
Jayalal Sarma
2007
Corpus ID: 10892052
The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC, and for the…
Expand
Review
2007
Review
2007
Computational Complexity of Dynamic Problems
T. Husfeldt
2007
Corpus ID: 14705601
This progress report surveys some of my scientiic work on part A of the Ph.D.-programme at the Computer Science Department of the…
Expand
2004
2004
First order quantifiers in monadic second order logic
H. Keisler
,
W. Lotfallah
Journal of Symbolic Logic (JSL)
2004
Corpus ID: 15639743
Abstract This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order…
Expand
2003
2003
The hardest linear conjunctive language
A. Okhotin
Information Processing Letters
2003
Corpus ID: 5227627
2002
2002
A linear conjunctive grammar for the circuit value problem
A. Okhotin
2002
Corpus ID: 59727765
In this paper we show that the P-complete language of yesinstances of Circuit Value Problem under a certain supplied encoding can…
Expand
1994
1994
On the parallel complexity of model checking in the modal mu-calculus
Shipei Zhang
,
O. Sokolsky
,
S. Smolka
Proceedings Ninth Annual IEEE Symposium on Logic…
1994
Corpus ID: 9569268
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE