Formalization of the class of problems solvable by a nondeterministic Turing machine (Q1280876)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Formalization of the class of problems solvable by a nondeterministic Turing machine |
scientific article |
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