Formalization of the class of problems solvable by a nondeterministic Turing machine

DOI10.1007/BF02667185zbMath0915.68055OpenAlexW2025543216MaRDI QIDQ1280876

Anatoly D. Plotnikov

Publication date: 28 April 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02667185

zbMATH Keywords

no-lookahead problemsNP class

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formalization of the class of problems solvable by a nondeterministic Turing machine