Two time-space tradeoffs for element distinctness
Theoretical Computer Science
Short propositional formulas represent nondeterministic computations
Information Processing Letters
Relativized polynomial time hierarchies having exactly K levels
SIAM Journal on Computing
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)
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Near-Optimal Time-Space Tradeoff for Element Distinctness
SIAM Journal on Computing
Relativized isomorphisms of NP-complete sets
Computational Complexity
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Relations Among Complexity Measures
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Using autoreducibility to separate complexity classes
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
IEEE Annals of the History of Computing
The recognition problem for the set of perfect squares
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
The problem of space invariance for sequential machines
Information and Computation
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds on the complexity of recognizing SAT by turing machines
Information Processing Letters
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
Fast Signature Matching Using Extended Finite Automaton (XFA)
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Diagonalization strikes back: some recent lower bounds in complexity theory
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.01 |
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that coSAT cannot be solved simultaneously in n^{1+o(1)} time and n^{1-e} space for any e0 on general random-access nondeterministic Turing machines. We also give several other related results. Our proof uses two basic ideas. First we show that if coSAT can be solved nondeterministically with a small amount of space then we can collapse a nonconstant number of levels of the polynomial-time hierarchy. Next we extend work of Nepomnjascii to show that a nondeterministic computation of super linear time and sublinear space can be simulated in alternating linear time. Combining these facts with simple diagonalization yields our main result. We discuss how these bounds lead to a new approach to separating the complexity classes NL and NP. We give some possibilities and limitations of this approach.