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(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 language | English |
|---|---|
| Title of host publication | Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992 |
| Publisher | Association for Computing Machinery |
| Pages | 619-623 |
| Number of pages | 5 |
| ISBN (Electronic) | 0897915119 |
| DOIs | |
| State | Published - 1 Jul 1992 |
| Event | 24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada Duration: 4 May 1992 → 6 May 1992 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
|---|---|
| Volume | Part F129722 |
| ISSN (Print) | 0737-8017 |
Conference
| Conference | 24th Annual ACM Symposium on Theory of Computing, STOC 1992 |
|---|---|
| Country/Territory | Canada |
| City | Victoria |
| Period | 4/05/92 → 6/05/92 |
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.