Formalization of the class of problems solvable by a nondeterministic Turing machine (Q1280876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1262950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Formalization of the class of problems solvable by a nondeterministic Turing machine |
scientific article; zbMATH DE number 1262950 |
Statements
Formalization of the class of problems solvable by a nondeterministic Turing machine (English)
0 references
28 April 1999
0 references
NP class
0 references
no-lookahead problems
0 references
0.7275307178497314
0 references
0.7222941517829895
0 references
