Sciweavers

Share
ECCC
2000

Simplified derandomization of BPP using a hitting set generator

9 years 8 months ago
Simplified derandomization of BPP using a hitting set generator
Abstract. 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.
Oded Goldreich, Salil P. Vadhan, Avi Wigderson
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2000
Where ECCC
Authors Oded Goldreich, Salil P. Vadhan, Avi Wigderson
Comments (0)
books