The Complexity of the Boolean Formula Value Problem (original) (raw)
Related papers
2005
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science, 2010
Complexity results for quantified boolean formulae based on complete propositional languages
Florian Letombe, Pierre Marquis
2006
On Maximal Boolean Complexity of Boolean Functions⋆
liafa.fr
The Complexity of Boolean Functions in Different Characteristics
computational complexity, 2010
Dagstuhl Seminar on The Complexity of Boolean Functions
Expressiveness and Complexity of Subclasses of Quantified Boolean Formulas
2010
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates
Theory of Computing Systems / Mathematical Systems Theory, 2007
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics, 2012
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
06111 Executive Summary -- Complexity of Boolean Functions
Lower bound for the Complexity of the Boolean Satisfiability Problem
arXiv (Cornell University), 2016
Data structures, minimization and complexity of boolean functions
1996
Collection Complexity of Boolean Functions Dagstuhl Seminar
2006
Complexity of computing with extended propositional logic programs
Annals of Mathematics and Artificial Intelligence, 1995
The complexity of minimum partial truth assignments and implication in negation-free formulae
Annals of Mathematics and Artificial Intelligence, 1996
Exact query complexity of some special classes of Boolean functions
Complexity and Limiting Ratio of Boolean Functions over Implication
Lecture Notes in Computer Science, 2008
On a hierarchy of Boolean functions hard to compute in constant depth
Discrete Mathematics & Theoretical Computer Science
On complexity reduction of Σ 1 formulas
Archive for Mathematical Logic, 2003
Descriptive complexity of circuit-based counting classes
2021
The Complexity of Boolean Functions
Solution-Graphs of Boolean Formulas and Isomorphism1
Journal on Satisfiability, Boolean Modeling and Computation, 2019
On the counting complexity of propositional circumscription
Information Processing Letters, 2008
Cognitive Complexity of Boolean Problems
… of Computer Science, 1999. 40th Annual …, 1999
2018
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
Lecture Notes in Computer Science, 2014
A Complete Characterization of Complexity for Boolean Constraint Optimization Problems
Lecture Notes in Computer Science, 2004
The Complexity of Boolean Constraint Isomorphism
Corr, 2003
An Algorithm to Evaluate Quantified Boolean Formulae
1998
A Polynomial Graphical Reduction to Speed Up the Counting of Models for Boolean Formulas
The complexity of the falsifiability problem for pure implicational formulas
Discrete Applied Mathematics, 1999
Applying Counting Models of Boolean Formulas to Propositional Inference