computational complexity

, Volume 4, Issue 1, pp 1–11

RL\( \subseteq \) SC

  • Noam Nisan

DOI: 10.1007/BF01205052

Cite this article as:
Nisan, N. Comput Complexity (1994) 4: 1. doi:10.1007/BF01205052


We show that any randomized logspace algorithm (running in polynomial time with bounded two-sided error) can be simulated deterministically in polynomial time andO(log2n) space. This puts RL in SC, “Steve's Class” In particular, we get a polynomial time,O(log2n) space algorithm for thest-connectivity problem on undirected graphs.Subject classifications. 68Q10, 68Q15, 68Q25.

Copyright information

© Birkhäuser Verlag 1994

Authors and Affiliations

  • Noam Nisan
    • 1
  1. 1.Department of Computer ScienceHebrew UniversityJerusalemIsrael

Personalised recommendations