An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(91)90054-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046523441 / rank | |||
Normal rank | |||
Revision as of 01:16, 20 March 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
