Lower bounds on the complexity of recognizing SAT by turing machines

Authors:
Rahul Santhanam
Affiliations:
Univ. of Chicago, Chicago, IL
Venue:
Information Processing Letters
Year:
2001

Citing 7
Cited 2

Two time-space tradeoffs for element distinctness

Theoretical Computer Science
Nearly linear time

Logic at Botik'89 Symposium on logical foundations of computer science
Near-Optimal Time-Space Tradeoff for Element Distinctness

SIAM Journal on Computing
Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space

Journal of the ACM (JACM)
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the Complexity of SAT

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Inductive Time-Space Lower Bounds for Sat and Related Problems

Computational Complexity
Alternation-Trading Proofs, Linear Programming, and Lower Bounds

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.89

Visualization

Abstract