Random walks, universal traversal sequences, and the complexity of maze problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1979, Pages 218-223

  Aleliunas, Romas ^a   Karp, Richard M ^b   Lipton, Richard J ^b   Lovász, Laszlo ^c   Rackoff, Charles ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85045415700     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1979.34     Document Type: Conference Paper

References (6)

1. J. Gill, "Complexity of probabilistic Turing machines," SIAM J. of Computing, Vol. 6, No. 4 (1977), 675-695.
2. F. Gobel and A. A. Jagers, "Random walks on graphs," J of Stochastic Processes and their Applications, 2 (1974), 311-336.
3. J. Hartmanis, N. Immerman, S. Mahaney, "Oneway log-tape reductions," 19th Annual Symposium on Foundations of Computer Science (1978), 65-71.
4. N. D. Jones, "Space-bounded reducibility among combinatorial problems," J. of Computer System Sciences, Vol. 11 (1965), 68-85.
5. N. D. Jones, Y. E. Lien, W. T. Laaser, "New problems complete for logspace," MST, Vol. 10 (1976), 1-17.
6. W. J. Savitch, "Relations between nondeterministic and deterministic tape complexities," J. of Computer System Sciences, Vol. 4 (1970), 122-129.