Back to search
Random walks, universal traversal sequences, and the complexity of maze problems
Data up to Jan 2025
Published1979
Citations735
References6
Total Citations Per Year
Abstract
References (6)
Relationships between nondeterministic and deterministic tape complexities
1970 • 1,361 citations
Computational Complexity of Probabilistic Turing Machines
1977 • 709 citations
Space-bounded reducibility among combinatorial problems
1975 • 371 citations
Random walks on graphs
1974 • 243 citations
New problems complete for nondeterministic log space
1976 • 134 citations
One-way log-tape reductions
1978 • 73 citations
Cited By (0)
Loading...