Better time-space lower bounds for SAT and related problems

We make several improvements on time lower bounds for concrete problems in NP and PH. 1) We present an elementary technique based on "indirect diagonalization" that uniformly improves upon the known nonlinear time lower bounds for nondeterminism and alternating computation, on both sublinear (n/sup o(1)/) space RAMs and sequential worktape machines with random access to the input. We obtain better lower bounds for SAT as well as all NP-complete problems that have efficient reductions from SAT and /spl Sigma//sub k/-SAT for constant k /spl ges/ 2. For example, SAT cannot be solved by random access machines using n/sup /spl radic/(3) /time and n/sub o(1)/ space. The technique is a natural inductive approach, for which previous work is essentially its base case. 2) We show how indirect diagonalization can also yield time-space lower bounds for computation with bounded nondeterminism. One corollary is that for all k, there exists a constant c/sub k/ > 1 such that satisfiability of Boolean circuits with n inputs and n/sup k/ gates cannot be solved in deterministic time n/sup k/spl middot/c//sub k/ and n/sup o(1)/ space.

[1]  Stephen A. Cook,et al.  Short Propositional Formulas Represent Nondeterministic Computations , 1988, Inf. Process. Lett..

[2]  Claus-Peter Schnorr.  Satisfiability Is Quasilinear Complete in NQL , 1978, JACM.

[3]  Lance Fortnow,et al.  Time-space tradeoffs for nondeterministic computation , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[4]  Ran Raz,et al.  A time lower bound for satisfiability , 2004, Theor. Comput. Sci..

[5]  Alan Cobham,et al.  The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[6]  Lance Fortnow.  Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[7]  Wolfgang Maass,et al.  Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape , 1987, SIAM J. Comput..

[8]  Rahul Santhanam.  Lower bounds on the complexity of recognizing SAT by Turing machines , 2001, Inf. Process. Lett..

[9]  Richard J. Lipton,et al.  On the complexity of SAT , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[10]  Iannis Tourlakis.  Time-space lower bounds for SAT on uniform and non-uniform machines , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[11]  Ravi Kannan,et al.  Alternation and the power of nondeterminism , 1983, STOC.

[12]  Liming Cai,et al.  On the Amount of Nondeterminism and the Power of Verifying , 1997, SIAM J. Comput..

[13]  D. Melkebeek.  TIME-SPACE LOWER BOUNDS FOR NP-COMPLETE PROBLEMS , 2004 .

[14]  Ravi Kannan.  Towards separating nondeterminism from determinism , 2005, Mathematical systems theory.

[15]  Saharon Shelah,et al.  Nearly Linear Time , 1989, Logic at Botik.