Symmetric space-bounded computation
Top Cited Papers
Open Access
- 27 March 2002
- journal article
- Published by Elsevier
- Vol. 19 (2) , 161-187
- https://doi.org/10.1016/0304-3975(82)90058-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- Translational lemmas, polynomial time, and (log n)j-spaceTheoretical Computer Science, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- A Note Concerning Nondeterministic Tape ComplexitiesJournal of the ACM, 1972
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Recursive Unsolvability of a problem of ThueThe Journal of Symbolic Logic, 1947