A time lower bound for satisfiability

Authors:
Dieter van Melkebeek;Ran Raz
Affiliations:
Department of Computer Sciences, University of Wisconsin, Madison, WI;Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Rehovot, Israel
Venue:
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Year:
2005

Citing 9
Cited 2

Short propositional formulas represent nondeterministic computations

Information Processing Letters
Two tapes versus one for off-line Turing machines

Computational Complexity
Relations Between Time and Tape Complexities

Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes

Journal of the ACM (JACM)
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
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape

Computational Complexity
Time-Space Tradeoffs for Nondeterministic Computation

COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
On the Complexity of SAT

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Alternation and the power of nondeterminism

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

Computational Complexity
Alternation-Trading Proofs, Linear Programming, and Lower Bounds

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a deterministic Turing machine with one d-dimensional work tape and random access to the input cannot solve satisfiability in time na for a d + 2)/(d + 1). For conondeterministic machines, we obtain a similar lower bound for any a such that a3 a/(d + 1). The same bounds apply to almost all natural NP-complete problems known.