Random walks, universal traversal sequences, and the complexity of maze problems
- 1 October 1979
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 218-223
- https://doi.org/10.1109/sfcs.1979.34
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- One-way log-tape reductionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Random walks on graphsStochastic Processes and their Applications, 1974
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970