Some notes on strong and weak log log n space complexity
- 10 November 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (2) , 109-112
- https://doi.org/10.1016/0020-0190(89)90163-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log nPublished by Springer Nature ,2005
- Remarks on languages acceptable in log log n spaceInformation Processing Letters, 1988
- Some observations concerning alternating turing machines using small spaceInformation Processing Letters, 1987
- Halting space-bounded computationsTheoretical Computer Science, 1980
- Space bounds for processing contentless inputsJournal of Computer and System Sciences, 1975
- Hierarchies of memory limited computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965