Abstract
We show that any randomized space(S) algorithm which uses only poly(S) random bits can be simulated deterministically in space(S), for 5(n) > logn. Of independent interest is our main technical tool: A procedure which extracts randomness from a defective random source using a small additional number of truly random bits.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993 |
| Publisher | Association for Computing Machinery |
| Pages | 235-244 |
| Number of pages | 10 |
| ISBN (Electronic) | 0897915917 |
| DOIs | |
| State | Published - 1 Jun 1993 |
| Event | 25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States Duration: 16 May 1993 → 18 May 1993 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
|---|---|
| Volume | Part F129585 |
| ISSN (Print) | 0737-8017 |
Conference
| Conference | 25th Annual ACM Symposium on Theory of Computing, STOC 1993 |
|---|---|
| Country/Territory | United States |
| City | San Diego |
| Period | 16/05/93 → 18/05/93 |
Bibliographical note
Publisher Copyright:© 1993 ACM.