Noam Nisan*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

46 Scopus citations


We show that any randomized Logspace algorithm (running in polynomial time, with bounded two-sided error) can be simulated deterministically in polynomial time and O(log2 n) space. This puts RL in SC, "Steve's Class". In particular, we get a polynomial time O(log2 n) space algorithm for the connectivity problem on undirected graphs.

Original languageAmerican English
Title of host publicationProceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992
PublisherAssociation for Computing Machinery
Number of pages5
ISBN (Electronic)0897915119
StatePublished - 1 Jul 1992
Event24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada
Duration: 4 May 19926 May 1992

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129722
ISSN (Print)0737-8017


Conference24th Annual ACM Symposium on Theory of Computing, STOC 1992

Bibliographical note

Funding Information:
For connectivity in undirected graphs two more types of algorithms are known. In [AKL*79] a randomized Logspace (and polynomial time) algorithm is given. A zero-error version of this type of *Dept. of CS, Hebrew University, Jerusalem. Supported by BSF 89-00126 and by a Wolfson research award.


Dive into the research topics of 'RL ⊆ SC'. Together they form a unique fingerprint.

Cite this