An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:11, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An NP-complete language accepted in linear time by a one-tape Turing machine |
scientific article |
Statements
An NP-complete language accepted in linear time by a one-tape Turing machine (English)
0 references
28 June 1992
0 references
one-tape nondeterministic Turing machines
0 references
