Relationships between Probabilistic and Deterministic Tape Complexity

By giving a matrix inversion algorithm that uses a small amount of space, a result of Simon is improved: For constructible functions f(n)∉ o(logn) f(n) tape-bounded probabilistic Turing machines can be simulated on deterministic ones within (f(n))2 space.

[1]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[2]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[3]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[4]  On tape Bounded probabilistic turing machine transducers , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).