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||American English|
|Title of host publication||Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993|
|Publisher||Association for Computing Machinery|
|Number of pages||10|
|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
|Name||Proceedings of the Annual ACM Symposium on Theory of Computing|
|Conference||25th Annual ACM Symposium on Theory of Computing, STOC 1993|
|Period||16/05/93 → 18/05/93|
Bibliographical noteFunding Information:
*Dept. of CS, Hebrew University, Jerusalem. Supported by BSF 89-00126 and by a Wolfson research award. Part of this research waa done while the author visited IBM Almaden. t MIT Lab for Computer Science, 545 Technology %u=e, Cambridge, MA 02139. Supported by an NSF Postdoctoral Fellowship. Part of this research was done while the author visited the Hebrew University in Jerusalem, Princeton University through DIMACS, and the International Computer Science Institute in Berkeley. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, raquires a fee and/or specific permission. 25th ACM STOC ‘93-51931CA,LJSA 0 1993 ACM 0-S9791-591 -7/93 /0005 /0235 ... $1 ,50
© 1993 ACM.