RL ⊆ SC

Noam Nisan

doi:10.1007/BF01205052

RL ⊆ SC

Noam Nisan^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

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

Original language	English
Pages (from-to)	1-11
Number of pages	11
Journal	Computational Complexity
Volume	4
Issue number	1
DOIs	https://doi.org/10.1007/BF01205052
State	Published - Mar 1994

Access to Document

10.1007/BF01205052

Cite this

@article{85858ff76aa64fdebc49ba91ea542771,

title = "RL ⊆ SC",

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.",

author = "Noam Nisan",

year = "1994",

month = mar,

doi = "10.1007/BF01205052",

language = "אנגלית",

volume = "4",

pages = "1--11",

journal = "Computational Complexity",

issn = "1016-3328",

publisher = "Birkhauser Verlag Basel",

number = "1",

}

TY - JOUR

T1 - RL ⊆ SC

AU - Nisan, Noam

PY - 1994/3

Y1 - 1994/3

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0038874554&partnerID=8YFLogxK

U2 - 10.1007/BF01205052

DO - 10.1007/BF01205052

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0038874554

SN - 1016-3328

VL - 4

SP - 1

EP - 11

JO - Computational Complexity

JF - Computational Complexity

IS - 1

ER -

RL ⊆ SC

Abstract

Access to Document

Other files and links

Fingerprint

Cite this