Lower bounds on the complexity of recognizing SAT by Turing machines (Q1603493): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 05:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the complexity of recognizing SAT by Turing machines |
scientific article |
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
