About the deterministic simulation of nondeterministic (log n)-tape bounded turing machines
- 1 January 1975
- book chapter
- Published by Springer Nature
- p. 118-126
- https://doi.org/10.1007/3-540-07407-4_15
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Postscript about NP-hard problemsACM SIGACT News, 1974
- On the structure of complexity classesPublished by Springer Nature ,1974
- On tape-bounded complexity classes and multi-head finite automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Maze recognizing automata and nondeterministic tape complexityJournal of Computer and System Sciences, 1973
- On non-determinancy in simple computing devicesActa Informatica, 1972
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965