NP is as easy as detecting unique solutions
Theoretical Computer Science
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Short propositional formulas represent nondeterministic computations
Information Processing Letters
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
An O(T log T) reduction from RAM computations to satisfiability
Theoretical Computer Science
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
A circuit-based proof of Toda's theorem
Information and Computation
Journal of Computer and System Sciences
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On quasilinear-time complexity theory
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Computational Complexity
SIAM Journal on Computing
SIAM Journal on Computing
The Shrinkage Exponent of de Morgan Formulas is 2
SIAM Journal on Computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
Relations Among Complexity Measures
Journal of the ACM (JACM)
Complexity limitations on Quantum computation
Journal of Computer and System Sciences
Time—space tradeoffs for satisfiability
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Quantum computation and quantum information
Quantum computation and quantum information
Introduction to Algorithms
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Time-Space Tradeoffs for Nondeterministic Computation
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Classical and Quantum Computation
Classical and Quantum Computation
Time-Space Tradeoffs in the Counting Hierarchy
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Better Time-Space Lower Bounds for SAT and Related Problems
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
SIAM Journal on Computing
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
On Approximate Majority and Probabilistic Time
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
Algorithms and resource requirements for fundamental problems
Algorithms and resource requirements for fundamental problems
Lower Bounds for Swapping Arthur and Merlin
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
ACM SIGACT News
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
An Improved Time-Space Lower Bound for Tautologies
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
An improved time-space lower bound for tautologies
Journal of Combinatorial Optimization
Arithmetic circuits: The chasm at depth four gets wider
Theoretical Computer Science
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.00 |
Ever since the fundamental work of Cook from 1971, satisfiability has been recognized as a central problem in computational complexity. It is widely believed to be intractable, and yet till recently even a linear-time, logarithmic-space algorithm for satisfiability was not ruled out. In 1997 Fortnow, building on earlier work by Kannan, ruled out such an algorithm. Since then there has been a significant amount of progress giving non-trivial lower bounds on the computational complexity of satisfiability. In this article, we survey the known lower bounds for the time and space complexity of satisfiability and closely related problems on deterministic, randomized, and quantum models with random access. We discuss the state-of-the-art results and present the underlying arguments in a unified framework.