If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 251-255
- https://doi.org/10.1007/bfb0028989
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Remarks on languages acceptable in log log n spaceInformation Processing Letters, 1988
- Number TheoryPublished by World Scientific Pub Co Pte Ltd ,1984
- On the LBA problemLecture Notes in Computer Science, 1981
- Halting space-bounded computationsTheoretical Computer Science, 1980
- 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