Better time-space lower bounds for SAT and related problems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 40-49

  Williams, Ryan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN CIRCUITS; NONLINEAR TIME LOWER BOUNDS; SEQUENTIAL WORKTAPE MACHINES;

NONLINEAR EQUATIONS; RANDOM ACCESS STORAGE; SEMICONDUCTOR DEVICES;

PROBLEM SOLVING;

EID: 27644497626     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2005.6     Document Type: Conference Paper

References (18)

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 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. v. Melkebeek. Time-Space Tradeoffs for Nondeterministic Computation. In Proceedings of the IEEE Conference on Computational Complexity, 2-13, 2000.
8. Y. Gurevich and S. Shelah. Nearly Linear Time. In Logic at Bolik'89, Symposium on Logical foundations of Computer Science, Springer LNCS 363:108-118, 1989.
9. R. J. Lipton and A. Viglas. On the Complexity of SAT. In Proceedings of IEEE FOCS, 459-464, 1999.
10. R. Kannan. Alternation and the power of nondeterminism. In Proceedings of ACM STOC, 344-346, 1983.
11. R. Kannan. Towards Separating Nondeterminism from Determinism. Mathematical Systems Theory 17(1):29-45, 1984.
12. 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.
13. D. van Melkebeek and R. Raz. A Time Lower Bound for Satisfiability. In Proceedings of ICALP, 971-982, 2004.
14. D. van Melkebeek. Time-Space Lower Bounds for NP-Complete Problems. In O. Raun, G. Rozenberg, and A. Salomaa (eds.), Current Trends in Theoretical Computer Science, 265-291, World Scientific, 2004.
15. V. Nepomnjaŝciǐ. Rudimentary predicates and Turing calculations. Soviet Mathematics Doklady, 11:1462-1465, 1970.
16. R. Santhanam. Lower bounds on the complexity of recognizing SAT by Turing machines. Info. Proc. Lett. 79(5):243-247, 2001.
17. C. P. Schnorr. Satisfiability is Quasilinear Complete in NQL. Journal of the ACM 25(1): 136-145, 1978.
18. I. Tourlakis. Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines. In Proceedings of the IEEE Conference on Computational Complexity, 22-33, 2000.