RL ⊆ SC

Noam Nisan*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

52 Scopus citations

Abstract

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(log2n) space. This puts RL in SC, "Steve's Class" In particular, we get a polynomial time, O(log2n) space algorithm for the st-connectivity problem on undirected graphs. Subject classifications. 68Q10, 68Q15, 68Q25.

Original languageAmerican English
Pages (from-to)1-11
Number of pages11
JournalComputational Complexity
Volume4
Issue number1
DOIs
StatePublished - Mar 1994

Fingerprint

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

Cite this