Inductive time-space lower bounds for sat and related problems

Computational Complexity

Volumn 15, Issue 4, 2006, Pages 433-470

  Williams, Ryan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Bounded nondeterminism; Diagonalization; Lower bounds; Polynomial time hierarchy; Satisfiability; Time space tradeoffs

Indexed keywords

EID: 34249034042     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-007-0221-1     Document Type: Conference Paper

References (26)

1. L. Cai and J. Chen. On the Amount of Nondeterminism and the Power of Verifying. SIAM J. Comput. 26(3):733-750, 1997.
2. A. K. Chandra, D. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM 28(1):114-133, 1981.
3. A. K. Chandra and L. J. Stockmeyer. Alternation. In Proceedings of IEEE FOCS 98-108, 1976.
4. A. Cobham. The Recognition Problem for the Set of Perfect Squares. In IEEE Symposium on Switching and Automata Theory, 78-87, 1966.
5. S. A. Cook. Short Prepositional Formulas Represent Nondeterministic Computations. Inf. Process. Lett. 26(5): 269-270 (1988)
6. L. Fortnow. Nondeterministic Polynomial Time Versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. In Proceedings of IEEE Conference on Computational Complexity, 52-60, 1997.
7. L. Fortnow and D. Van Melkebeek. Time-Space Tradeoffs for Nondeterministic Computation. In Proceedings of the IEEE Conference on Computational Complexity, 2-13, 2000.
8. L. Fortnow, R. Lipton, D. Van Melkebeek, and A. Viglas. Time-Space Lower Bounds for Satisfiability. Journal of the ACM 52(6):835-865, 2005.
9. Y. Gurevich and S. Shelah. Nearly Linear Time. In Logic at Botik'89, Symposium on Logical Foundations of Computer Science, Springer LNCS 363:108-118, 1989.
10. J. Håstad. Computational Limitations for Small Depth Circuits. PhD Thesis, MIT Press, 1986.
11. J. Hopcroft, W. J. Paul, L. Valiant. On Time vs. Space. Journal of the ACM 24(2):332-337, 1977.
12. R. Kannan. Alternation and the Power of Nondeterminism. In Proceedings of ACM STOC, 344-346, 1983.
13. R. Kannan. Towards Separating Nondeterminism from Determinism. Mathematical Systems Theory 17(1):29-45, 1984.
14. R. J. Lipton and A. Viglas. On the Complexity of SAT. In Proceedings of IEEE FOCS, 459-464, 1999.
15. W. Maass and A. Schorr. Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape. SIAM J. Comput. 16(1):195-202, 1987.
16. D. van Melkebeek and R. Raz. A Time Lower Bound for Satisfiability. In Proceedings of ICALP, 971-982, 2004.
17. D. van Melkebeek. Time-Space Lower Bounds for NP-Complete Problems. In G. Paun, G. Rozenberg, and A. Salomaa (eds.), Current Trends in Theoretical Computer Science, 265-291, World Scientific, 2004.
18. V. Nepomnjascii. Rudimentary Predicates and Turing Calculations. Soviet Mathematics Doklady, 11:1462-1465, 1970.
19. W. J. Paul and R. Reischuk. On Time versus Space II. (Turing Machines). J. Comput. Syst. Sci. 22(3):312-327, 1981.
20. W. Paul, N. Pippenger, E. Szemeredi, and W. Trotter. On Determinism versus Nondeterminism and Related Problems. In Proceedings of IEEE FOCS, 429-438, 1983.
21. N. Pippenger and M. J. Fischer. Relations Among Complexity Measures. Journal of the ACM 26(2):361-381, 1979.
22. R. Santhanam. Lower Bounds on the Complexity of Recognizing SAT by Turing Machines. Info. Proc. Lett. 79(5):243-247, 2001.
23. W. J. Savitch. Relationships Between Nondeterministic and Deterministic Tape Complexities. J. Comput. Syst. Sci. 4(2): 177-192, 1970.
24. C. P. Schnorr. Satisfiability is Quasilinear Complete in NQL. J. of the ACM 25(1):136-145, 1978.
25. I. Tourlakis. Time-Space Tradeoffs for SAT on Nonuniform Machines. J. Comput. Syst. Sci. 63(2): 268-287, 2001.
26. R. Williams. Better Time-Space Lower Bounds for SAT and Related Problems. In Proceedings of the IEEE Conference on Computational Complexity, 40-49, 2005.