On eliminating nondeterminism from turing machines which use less than logarithm worktape space
- 31 December 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 21 (3), 237-253
- https://doi.org/10.1016/0304-3975(82)90075-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Lower bounds on space complexity for contextfree recognitionActa Informatica, 1979
- Techniques for separating space complexity classesJournal of Computer and System Sciences, 1977
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- The NP-Completeness of the bandwidth minimization problemComputing, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970