On relationships between complexity classes of Turing machines (Q1682916)
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: On relationships between complexity classes of Turing machines |
scientific article; zbMATH DE number 6815874
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On relationships between complexity classes of Turing machines |
scientific article; zbMATH DE number 6815874 |
Statements
On relationships between complexity classes of Turing machines (English)
0 references
6 December 2017
0 references
P vs NP problem
0 references
\(\mathrm{DSPACE}(|X|^n)\) vs \(\mathrm{NSPACE}(|X|^n)\)
0 references
polynomial reducibility
0 references
Karp reducibility
0 references
NP-complete Turing machines
0 references
computational complexity
0 references
deterministic Turing machines
0 references
nondeterministic Turing machines
0 references
