Weak Random Sources, Hitting Sets, and BPP Simulations
نویسندگان
چکیده
We show how to simulate any BPP algorithm in polynomial time by using a weak random source of r bits and min-entropy r for any γ > 0. This follows from a more general result about sampling with weak random sources. Our result matches an information-theoretic lower bound and solves a question that has been open for some years. The previous best results were a polynomial time simulation of RP [M. Saks, A. Srinivasan, and S. Zhou, Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 479–488] and a quasi-polynomial time simulation of BPP [A. Ta-Shma, Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 276–285]. Departing significantly from previous related works, we do not use extractors; instead, we use the OR-disperser of Saks, Srinivasan, and Zhou in combination with a tricky use of hitting sets borrowed from [Andreev, Clementi, and Rolim, J. ACM, 45 (1998), pp. 179–213].
منابع مشابه
Deterministic Ampli cation , and Weak
We use a certain type of expanding bipartite graphs, called disperser graphs, to design procedures for picking highly correlated samples from a nite set, with the property that the probability of hitting any suuciently large subset is high. These procedures require a relatively small number of random bits and are robust with respect to the quality of the random bits. Using these sampling proced...
متن کاملImproved Derandomization of BPP Using a Hitting Set Generator
A hitting-set generator is a deterministic algorithm which generates a set of strings that intersects every dense set recognizable by a small circuit. A polynomial time hitting-set generator readily implies $RP=P$. Andreev et. Al (ICALP’96 and JACM 1998) showed that if polynomial-time hitting-set generator in fact implies the much stronger conclusion $BPP=P$. We simplify and improve their (and ...
متن کاملComputing with Very Weak Random Sources
For any fixed 6 > 0, we show how to simulate RP algorithms in time n O ( ‘ O g n ) using the output of a 6-source wath min-entropy R‘. Such a weak random source is asked once for R bits; it outputs an Rbit string such that any string has probability at most 2 R c . I f 6 > 1 l/(k + l) , our BPP simulations take time no(‘og(k)n) (log(k) is the logarithm iterated k times). We also gave a polynomi...
متن کاملUnbiased Bits from Sources of Weak
? A new model for weak random physical sources is presented. The new model strictly generalizes previous models (e.g. the Santha and Vazirani model 24]). The sources considered output strings according to probability distributions in which no single string is too probable. The new model provides a fruitful viewpoint on problems studied previously as: Extracting almost perfect bits from sources ...
متن کاملDisperser Graphs, Deterministic Amplification and Imperfect Random Sources
We use a certain type of expanding bipartite graphs, called disperser graphs, to design procedures for sampling a finite number of elements from a finite set, with the property that the probability of hitting any sufficiently large subset is high. The advantages of these procedures are: 1. They require a relatively small number of random bits. 2. They are robust with respect to the quality of t...
متن کامل