Random walks, universal traversal sequences, and the complexity of maze problems
暂无分享,去创建一个
Richard J. Lipton | László Lovász | Richard M. Karp | Charles Rackoff | Romas Aleliunas | R. Karp | R. Lipton | L. Lovász | C. Rackoff | R. Aleliunas
[1] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[2] F. Göbel,et al. Random walks on graphs , 1974 .
[3] Neil D. Jones,et al. Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..
[4] John Gill,et al. Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..
[5] Neil Immerman,et al. One-way log-tape reductions , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).