Simplified 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 6650 LNCS, Issue , 2011, Pages 59-67

  Goldreich, Oded ^a   Vadhan, Salil ^a   Wigderson, Avi ^a  

^a NONE

Author keywords

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

Indexed keywords

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

ALGORITHMS;

POLYNOMIAL APPROXIMATION;

EID: 84857619236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22670-0_8     Document Type: Article

References (11)

1. Adleman, L.: Two theorems on random polynomial-time. In: 19th FOCS, pp. 75-83 (1978)
2. Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P.: A new general derandomization method. Journal of the Association for Computing Machinery (J. of ACM) 45(1), 179-213 (1998); Hitting Sets Derandomize BPP. In: XXIII International Colloquium on Algorithms, Logic and Programming, ICALP 1996 (1996)
3. Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P., Trevisan, L.: Weak Random Sources, Hitting Sets, and BPP Simulations. To appear in SICOMP (1997); Preliminary version in 38th FOCS, pp. 264-272 (1997).
4. Buhrman, H., Fortnow, L.: One-sided versus two-sided randomness. In: Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science. LNCS, Springer, Berlin (1999)
5. Even, S., Selman, A.L., Yacobi, Y.: The Complexity of Promise Problems with Applications to Public-Key Cryptography. Inform. and Control 61, 159-173 (1984)
6. Goldreich, O., Zuckerman, D.: Another proof that BPP PH (and more). In: Goldreich, O., et al.: Studies in Complexity and Cryptography. LNCS, vol. 6650, pp. 40-53. Springer, Heidelberg (1997)
7. Goldreich, O., Wigderson, A.: Improved derandomization of BPP using a hitting set generator. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 131-137. Springer, Heidelberg (1999)
8. Impagliazzo, R., Wigderson, A.: P=BPP unless E has Subexponential Circuits: Derandomizing the XOR Lemma. In: 29th STOC, pp. 220-229 (1997)
9. Lautemann, C.: BPP and the Polynomial Hierarchy. Information Processing Letters 17, 215-217 (1983)
10. Sipser, M.: A complexity-theoretic approach to randomness. In: 15th STOC, pp. 330-335 (1983)
11. Zuckerman, D.: Simulating BPP Using a General Weak Random Source. Algorithmica 16, 367-391 (1996)