We present a new technique for using catalytic space to simulate space-bounded randomized algorithms.
Allocate one bit on the catalytic tape for each configuration of a randomized machine.
Simulate the machine several times.
Each time it requests a random bit, use the bit from the catalytic tape corresponding to its ...
more >>>
Two fundamental problems on directed graphs are to decide $s$-$t$ connectivity, and to estimate the behavior of random walks. Currently, there is no known algorithm for $s$-$t$ connectivity running in polynomial time and $n^{o(1)}$ space, and no known algorithm for estimating the $n$-step random walk matrix running in non-deterministic logspace. ... more >>>