On relationships between complexity classes of Turing machines (Q1682916): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MathOverflow / rank | |||
Normal rank | |||
Revision as of 07:36, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On relationships between complexity classes of Turing machines |
scientific article |
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
