论文信息 - Lower bounds on the complexity of recognizing SAT by Turing machines - 字舞流文

Lower bounds on the complexity of recognizing SAT by Turing machines

Rahul Santhanam

[1] Zvi Galil,et al. Proceedings of the 30th IEEE symposium on Foundations of computer science , 1994, FOCS 1994.

[2] Endre Szemerédi,et al. On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[3] Andrew Chi-Chih Yao. Near-Optimal Time-Space Tradeoff for Element Distinctness , 1994, SIAM J. Comput..

[4] Saharon Shelah,et al. Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space , 1988, JACM.

[5] Chung Keung Poon,et al. A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model , 1995, STOC '95.

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

[7] Mauricio Karchmer. Two Time-Space Tradeoffs for Element Distinctness , 1986, Theor. Comput. Sci..

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

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

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