Nondeterministic Turing machines with modified acceptance
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 396-404
- https://doi.org/10.1007/bfb0016264
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the boolean closure of NPPublished by Springer Nature ,2005
- The boolean hierarchy: Hardware over NPPublished by Springer Nature ,1986
- NP is as easy as detecting unique solutionsPublished by Association for Computing Machinery (ACM) ,1985
- On the unique satisfiability problemInformation and Control, 1982