Lower bounds on the complexity of recognizing SAT by Turing machines

Information Processing Letters

Volumn 79, Issue 5, 2001, Pages 243-247

  Santhanam, Rahul ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Computational complexity; Satisfiability; Time space tradeoffs

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DIGITAL ARITHMETIC; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; TURING MACHINES;

SATISFIABILITY LANGUAGE;

COMPUTATIONAL COMPLEXITY;

EID: 0035885377     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00227-1     Document Type: Article

References (11)

1. The recognition problem for the set of perfect squares
2. A time-space tradeoff for language recognition
3. A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model
4. Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability
5. Nearly-linear time
6. Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space
7. Towards separating nondeterminism from determinism
8. Two time-space tradeoffs for element distinctness
9. On the complexity of SAT
10. On determinism versus non-determinism and related problems
11. Near-optimal time-space tradeoff for element distinctness