On relationships between complexity classes of Turing machines (Q1682916): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s096554251704011x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2615658319 / rank | |||
Normal rank | |||
Latest revision as of 09:25, 30 July 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
