Improved derandomization of BPP using a hitting set generator

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1671, Issue , 1999, Pages 131-137

  Goldreich, Oded ^a   Wigderson, Avi ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

BPP; Derandomization; One sided error versus two sided error; RP

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

DERANDOMIZATION; DETERMINISTIC ALGORITHMS; HITTING SET GENERATORS; POLYNOMIAL-TIME;

APPROXIMATION ALGORITHMS;

EID: 84958765622     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_14     Document Type: Conference Paper

References (10)

1. A.E. Andreev, A.E.F. Clementi, and J.D.P. Rolim. A new general derandomization method. Journal of the Association for Computing Machinery (J. of ACM), 45(1), pages 179-213,1998. Hitting Sets Derandomize BPP. In XXIII International Colloquium on Algorithms, Logic and Programming (ICALP'96), 1996.
2. A.E. Andreev, A.E.F. Clementi, J.D.P. Rolim and L. Trevisan, Weak Random Sources, Hitting Sets, and BPP Simulations. To appear in SIAM J. on Comput. Preliminary version in 38th FOCS, pages 264-272, 1997.
3. H. Buhrman and L. Fortnow. One-sided versus two-sided randomness. In Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, Springer, Berlin, 1999.
4. S. Even, A.L. Selman, and Y. Yacobi. The Complexity of Promise Problems with Applications to Public-Key Cryptography. Inform. and Control, Vol. 61, pages 159-173, 1984.
5. O. Goldreich and D. Zuckerman. Another proof that BPP subseteq PH (and more). ECCC, TR97-045, 1997.
6. R. Impagliazzo, A. Wigderson, P=BPP unless E has Subexponential Circuits: Derandomizing the XOR Lemma. 29th STOC, pages 220-229, 1997.
7. R. Raz, O. Reingold and S. Vadhan. Extracting all the Randomness and Reducing the Error in Trevisan's Extractors In 31st STOC, pages 149-158, 1999.
8. M. Sipser. A complexity-theoretic approach to randomness. In 15th STOC, pages 330-335, 1983.
9. L. Trevisan. Constructions of Near-Optimal Extractors Using Pseudo- Random Generators. In 31st STOC, pages 141-148, 1999.
10. D. Zuckerman. Simulating BPP Using a General Weak Random Source. Algorithmica, Vol. 16, pages 367-391, 1996.