RL $ \subseteq $ SC
Author:
- 1 March 1994
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 4 (1) , 1-11
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On read once vs. multiple access to randomness in logspaceTheoretical Computer Science, 1993
- Pseudorandom generators for space-bounded computationCombinatorica, 1992
- Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.1991
- Two Applications of Inductive Counting for Complementation ProblemsSIAM Journal on Computing, 1989
- Random walks, universal traversal sequences, and the complexity of maze problems1979
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970