Simplified Derandomization of BPP Using a Hitting Set Generator

A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit. A polynomial time hitting-set generator readily implies RP = P , but it is not apparent what this implies for BPP. Nevertheless, Andreev et al. (ICALP’96, and JACM 1998) showed that a polynomial-time hitting-set generator implies the seemingly stronger conclusion BPP = P . We simplify and improve their (and later) constructions.

[1]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[3]  David Zuckerman.  Simulating BPP using a general weak random source , 2005, Algorithmica.

[4]  José D. P. Rolim,et al.  Weak random sources, hitting sets, and BPP simulations , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[5]  Avi Wigderson,et al.  Improved Derandomization of BPP Using a Hitting Set Generator , 1999, RANDOM-APPROX.

[6]  Clemens Lautemann,et al.  BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..

[7]  Lance Fortnow,et al.  One-sided Versus Two-sided Randomness , 1998 .

[8]  Oded Goldreich,et al.  Another proof that bpp?ph (and more) , 1997 .

[9]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[10]  R. Impagliazzo,et al.  P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma , 2002 .

[11]  José D. P. Rolim,et al.  A new general derandomization method , 1998, JACM.

[12]  Oded Goldreich,et al.  Another proof that BPP subseteq PH (and more) , 1997, Electron. Colloquium Comput. Complex..