A time lower bound for satisfiability

Theoretical Computer Science

Volumn 348, Issue 2-3 SPEC. ISS., 2005, Pages 311-320

  Van Melkebeek, Dieter ^a   Raz, Ran ^b  

^a University of Wisconsin Madison   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Computational complexity; Lower bounds; Satisfiability

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

LOWER BOUNDS; SATISFIABILITY;

TURING MACHINES;

EID: 33644557714     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.020     Document Type: Conference Paper

References (15)

1. S. Cook A hierarchy theorem for nondeterministic time complexity J. Comput. System Sci. 7 1973 343 353
2. S. Cook Short propositional formulas represent nondeterministic computations Inform. Process. Lett. 26 1988 269 270
3. M. Dietzfelbinger, and M. Hühne Matching upper and lower bounds for simulations of several tapes on one multidimensional tape Comput. Complexity 8 1999 371 392
4. L. Fortnow Time-space tradeoffs for satisfiability J. Comput. System Sci. 60 2000 337 353
5. L. Fortnow, and D. van Melkebeek Time-space tradeoffs for nondeterministic computation Proc. of the 15th IEEE Conf. on Computational Complexity 2000 IEEE New York 2 13
6. F. Hennie One-tape off-line Turing machine computations Inform. and Control 8 1965 553 578
7. J. Hopcroft, and J. Ullman Relations between time and tape complexities J. Assoc. Comput. Mach. 15 1968 414 427
8. R. Kannan Alternation and the power of nondeterminism Proc. of the 25th ACM Symp. on the Theory of Computing 1983 ACM New York 344 346
9. R. Kannan Towards separating nondeterminism from determinism Math. Systems Theory 17 1984 29 45
10. R. Lipton, and A. Viglas On the complexity of SAT Proc. of the 40th IEEE Symp. on Foundations of Computer Science 1999 IEEE New York 459 464
11. W. Maass, G. Schnitger, E. Szemeredi, and G. Turan Two tapes versus one for off-line Turing machines Comput. Complexity 3 1993 392 401
12. V. Nepomnjaščiǐ Rudimentary predicates and Turing calculations Soviet Math. Dokl. 11 1970 1462 1465
13. J. Seiferas, M. Fischer, and A. Meyer Separating nondeterministic time complexity classes J. Assoc. Comput. Mach. 25 1978 146 167
14. D. van Melkebeek Time-space lower bounds for satisfiability Bull. of the European Assoc. Theoret. Comput. Sci. 73 2001 57 77
15. K. Wagner, and G. Wechsung Computational Complexity 1986 Reidel Publishing Dordrecht