Abstract
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 \(\mathcal{RP} = \mathcal{P}\). Andreev et. al. (ICALP’96, and JACM 1998) showed that if polynomial-time hitting-set generator in fact implies the much stronger conclusion \(\mathcal{BPP} = \mathcal{P}\). We simplify and improve their (and later) constructions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099. Springer, Heidelberg (1996)
Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P., Trevisan, L.: Weak Random Sources, Hitting Sets, and BPP Simulations. To appear in SIAM J. on Comput. Preliminary version in 38th FOCS, 264–272 (1997)
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)
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)
Goldreich, O., Zuckerman, D.: Another proof that BPP subseteq PH (and more). ECCC, TR97-045 (1997)
Impagliazzo, R., Wigderson, A.: P=BPP unless E has Subexponential Circuits: Derandomizing the XOR Lemma. in: 29th STOC, pp. 220–229 (1997)
Raz, R., Reingold, O., Vadhan, S.: Extracting all the Randomness and Reducing the Error in Trevisan’s Extractors. In: 31st STOC, pp. 149–158 (1999)
Sipser, M.: A complexity-theoretic approach to randomness. In: 15th STOC, pp. 330–335 (1983)
Trevisan, L.: Constructions of Near-Optimal Extractors Using Pseudo- Random Generators. In: 31st STOC, pp. 141–148 (1999)
Zuckerman, D.: Simulating BPP Using a General Weak Random Source. Algorithmica 16, 367–391 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldreich, O., Wigderson, A. (1999). Improved Derandomization of BPP Using a Hitting Set Generator. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-48413-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66329-4
Online ISBN: 978-3-540-48413-4
eBook Packages: Springer Book Archive