Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity (original) (raw)
Related papers
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science, 2010
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits
Lecture Notes in Computer Science, 2015
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates
Theory of Computing Systems / Mathematical Systems Theory, 2007
Complexity results for quantified boolean formulae based on complete propositional languages
Florian Letombe, Pierre Marquis
2006
2005
Lower bound frontiers in arithmetical circuit complexity
2006
A satisfiability procedure for quantified Boolean formulae
Discrete Applied Mathematics, 2003
Expressiveness and Complexity of Subclasses of Quantified Boolean Formulas
2010
Satisfiability in multi-valued circuits
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
Algorithms for quantified Boolean formulas
2002
Algorithms for solving Boolean satisfiability in combinational circuits
1999
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
Lecture Notes in Computer Science, 2014
Lower bound for the Complexity of the Boolean Satisfiability Problem
arXiv (Cornell University), 2016
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics, 2012
New upper bounds on the Boolean circuit complexity of symmetric functions
A. Kojevnikov, E. Demenkov, G. Yaroslavtsev
Information Processing Letters, 2010
The Complexity of the Boolean Formula Value Problem
An Algorithm to Evaluate Quantified Boolean Formulae
1998
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems
Proof Complexity of Resolution-based QBF Calculi
Electron. Colloquium Comput. Complex., 2014
Lower bounds of the negation-limited circuit complexity
1997
Satisfiability and Derandomization for Small Polynomial Threshold Circuits
Electron. Colloquium Comput. Complex., 2018
Amplifying circuit lower bounds against polynomial time, with applications
computational complexity, 2013
On the Complexity of SAT (Revised)
2008
The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk)
International journal on advances in intelligent systems, 2013
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
2008
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014
Definability by constant-depth polynomial-size circuits
1986
Formal Methods in System Design, 2021
Efficient translation of Boolean formulas to CNF in formal verification of microprocessors
ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)
The Complexity of Boolean Functions in Different Characteristics
computational complexity, 2010
New Resolution-Based QBF Calculi and Their Proof Complexity
ACM Transactions on Computation Theory, 2019
A logic for constant-depth circuits
Information and Control, 1984
On the complexity of computing tests for CMOS gates
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989