The Community for Technology Leaders
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
ISBN: 0-8186-2445-0
pp: 79-89
D. Zuckerman , Lab. Comput. Sci., MIT, Cambridge, MA, USA
It is shown how to simulate BPP and approximation algorithms in polynomial time using the output from a delta -source. A delta -source is a weak random source that is asked only once for R bits, and must output an R-bit string according to some distribution that places probability no more than 2/sup - delta R/ on any particular string. Also given are two applications: one to show the difficulty of approximating the size of the maximum clique, and the other to the problem of implicit O(1) probe search.
probe search, BPP simulation, general weak random source, approximation algorithms, polynomial time, weak random source, R-bit string, maximum clique

D. Zuckerman, "Simulating BPP using a general weak random source," [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS), San Juan, Puerto Rico, 1991, pp. 79-89.
91 ms
(Ver 3.3 (11022016))