Time-space lower bounds for satisfiability

Journal of the ACM

Volumn 52, Issue 6, 2005, Pages 835-865

  Fortnow, Lance ^a,e   Lipton, Richard ^b,f   Van Melkebeek, Dieter ^c,g   Viglas, Anastasios ^d,h  

^a UNIVERSITY OF CHICAGO   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

^d UNIVERSITY OF SYDNEY   (Australia)

^e THE UNIVERSITY OF CHICAGO   (United States)

^f Georgia Institute of Technology   (United States)

^g University of Wisconsin Madison   (United States)

^h UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Complexity of satisfiability; Time space lower bounds

Indexed keywords

COMPLEXITY OF SATISFIABILITY; NONDETERMINISTIC LINEAR TIME; TIME-SPACE LOWER BOUNDS;

HIERARCHICAL SYSTEMS; LINEAR SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES;

POLYNOMIALS;

EID: 33745197972     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1101821.1101822     Document Type: Article

References (24)

1. AJTAI, M. 1999. A non-linear time lower bound for Boolean branching programs. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 60-70.
2. ALLENDER, E., KOUCKY, M., RONNEBURGER, D., ROY, S., AND VINAY, V. 2001. Time-space tradeoffs in the counting hierarchy. In Proceedings of the 16th IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 295-302.
3. BALCÁZAR, J., DÍAZ, J., AND GABARRÓ, J. 1995. Structural Complexity I. EATCS Monographs on Theoretical Computer Science, vol. 11. Springer-Verlag; New York.
4. BEAME, P., SAKS, M., SUN, X., AND VEE, E. 2003. Time-space trade-off lower bounds for randomized computation of decision problems. J. ACM 50, 2, 154-195.
5. BRUSS, A., AND MEYER, A. 1980. On time-space classes and their relation to the theory of real addition. Theoret. Comput. Sci. 11, 59-69.
6. COOK, S. 1988. Short propositional formulas represent nondeterministic computations. Inf. Proc. Lett. 26, 269-270.
7. FORTNOW, L. 2000a. Diagonalization. Bull. Europ. Assoc. Theoret. Comput. Sci. 71, 102-112.
8. FORTNOW, L. 2000b. Time-space tradeoffs for satisfiability. J. Comput. Syst. Sci. 60, 337-353.
9. FORTNOW, L., AND LUND, C. 1993. Interactive proof systems and alternating time-space complexity. Theoret. Comput. Sci. 113, 55-73.
10. FORTNOW, L., AND VAN MELKEBEEK, D. 2000. Time-space tradeoffs for nondeterministic computation. In Proceedings of the 15th IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 2-13.
11. GUREVICH, Y., AND SHELAH, S. 1989. Nearly-linear time. In Proceedings, Logic at Botik '89. Lecture Notes in Computer Science, vol. 363. Springer-Verlag, New York, 108-118.
12. HENNIE, F., AND STEARNS, R. 1966. Two-tape simulation of multitape Turing machines. J. ACM 13, 533-546.
13. KANNAN, R. 1984. Towards separating nondeterminism from determinism. Math. Syst. Theory 17, 29-45.
14. LIPTON, R., AND VIOLAS, A. 1999. On the complexity of SAT. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 459-464.
15. PAPADIMITRIOU, C. 1994. Computational Complexity. Addison-Wesley, Reading, MA.
16. PAUL, W., PIPPENGER, N., SZEMERIDI, E., AND TROTTER, W. 1983. On determinism versus non-determinism and related problems. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 429-438.
17. PAUL, W., PRAUß, E., AND REISCHUK, R. 1980. On alternation. Acta Inf. 14, 243-255.
18. PIPPENGER, N., AND FISCHER, M. 1979. Relations among complexity measures. J. ACM 26, 361-381.
19. SCHNORR, C. 1978. Satisfiability is quasilinear complete in NQL. J. ACM 25, 136-145.
20. SEIFERAS, J., FISCHER, M., AND MEYER, A. 1978. Separating nondeterministic time complexity classes. J. ACM 25, 146-167.
21. TOURLAKIS, I. 2001. Time-space lower bounds for SAT on nonuniform machines. J. Comput. Syst. Sci. 63, 2, 268-287.
22. VAN MELKEBEEK, D. 2004. Time-space lower bounds for NP-complete problems. In Current Trends in Theoretical Computer Science, G. Paun, G. Rozenberg, and A. Salomaa, Eds. World Scientific, 265-291.
23. VAN MELKEBEEK, D., AND RAZ, R. 2004. A time lower bound for satisfiability. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming. Springer-Verlag, New York, 971-982.
24. ŽÀK, S. 1983. A Turing machine time hierarchy. Theoret. Comput. Sci. 26, 327-333.