Lower bounds on the complexity of recognizing SAT by Turing machines (Q1603493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds on the complexity of recognizing SAT by Turing machines |
scientific article; zbMATH DE number 1767386
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the complexity of recognizing SAT by Turing machines |
scientific article; zbMATH DE number 1767386 |
Statements
Lower bounds on the complexity of recognizing SAT by Turing machines (English)
0 references
14 July 2002
0 references
Computational complexity
0 references
Time-space tradeoffs
0 references
Satisfiability
0 references
