Abstract
We show that quick hitting set generators can replace quick pseudorandom generators to derandomize any probabilistic two-sided error algorithms. Up to now quick hitting set generators have been known as the general and uniform derandomization method for probabilistic one-sided error algorithms, while quick pseudorandom generators as the generators as the general and uniform method to derandomize probabilistic two-sided error algorithms.
Our method is based on a deterministic algorithm that, given a Boolean circuit C and given access to a hitting set generator, constructs a discrepancy set for C. The main novelty is that the discrepancy set depends on C, so the new derandomization method is not uniform (i.e., not oblivious).
The algorithm works in time exponential in k(p(n)) where k(*) is the price of the hitting set generator and p(*) is a polynomial function in the size of C. We thus prove that if a logarithmic price quick hitting set generator exists then BPP = P.
- ANDREEV, A., BASKAKOV, J., CLEMENTI, A., AND ROLIM, J. 1997a. Small random sets for affine spaces and better explicit lower bounds for branching programs. ECCC, TR97-053.Google Scholar
- ANDREEV, A., CLEMENTI, A., AND ROLIM, J. 1996. Hitting properties of hard Boolean operators and their consequences on BPP. ECCC, TR96-055.Google Scholar
- ANDREEV, A., CLEMENTI, A., AND ROLIM, J. 1997b. Efficient constructions of hitting sets for systems of linear functions. In Proceedings of the XIVAnnual Symposium on the Theoretical Aspects of Computer Science (STACS'97). Lecture Notes in Computer Science, vol. 1200. Springer-Verlag, New York, pp. 357-368 (also available in ECCC as TR96-029). Google Scholar
- ANDREEV, A., CLEMENTI, A., AND ROLIM, J. 1997c. Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs. In Proceedings of the 24th Annual International Colloquium on Algorithms, Logic and Programming (ICALP'97). Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, New York, pp. 177-187. Google Scholar
- ANDREEV, A., CLEMENTI, A., ROLIM, J., AND TREVISAN, L. 1997d. Weak random sources, hitting sets, and BPP simulation. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 264-273. (Full version to appear in SIAM J. Comput.) Google Scholar
- BELLARE, M., AND ROMPEL, J. 1994. Randomness-efficient oblivious sampling. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 276-287.Google Scholar
- BLUM, M., AND MICALI, S. 1984. How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13, 4, 850-864. Google Scholar
- CHOR, B., AND GOLDREICH, O. 1988. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17, 2, 230-261. Google Scholar
- GOLDREICH, O. 1997. A sample of samplers: A computational perspective on sampling. In Electronic Colloquium on Computational Complexity (ECCC). TR97-20.Google Scholar
- MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass. Google Scholar
- NISAN, N. 1990. Using hard problems to create pseudorandom generators, ACM distinguished dissertation. MIT Press, Cambridge, Mass. Google Scholar
- NISAN, N. 1996. Exacting randomness: How and why. In Proceedings of the llth Annual IEEE Conference on Computational Complexity. IEEE, New York, pp. 44-58. Google Scholar
- NISAN, N., AND WIGDERSON, A. 1994. Hardness vs. randomness. J. Comput. Syst. Sci. 49, 149-167. Google Scholar
- PAPADIMITRIOU, C.H. 1993. Computational Complexity. Addison-Wesley, Reading, Mass.Google Scholar
- SAKS, M., SRINIVASAN, A., AND ZHOU, S. 1998. Explicit OR-dispersers with polylogarithmic degree. J. ACM 45, 1 (Jan.), 123-154. Google Scholar
- WEGEYER, I. 1987. The Complexity of Finite Boolean Functions. Wiley-Teubner Series in Computer Science. Wiley, New York. Google Scholar
- TA-SHMA, A. 1996. On extracting randomness from weak random sources. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 276-285. Google Scholar
- YAO, A. 1982. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on Foundations on Computer Science. IEEE, New York, pp. 80-91.Google Scholar
Index Terms
A new general derandomization method
Recommendations
Simplified derandomization of BPP using a hitting set generator
Studies in complexity and cryptographyA 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 ...
Derandomizing polynomial identity tests means proving circuit lower bounds
STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computingWe show that derandomizing Polynomial Identity Testing is, essentially, equivalent to proving circuit lower bounds for NEXP. More precisely, we prove that if one can test in polynomial time (or, even, nondeterministic subexponential time, infinitely ...
In a world of P=BPP
Studies in complexity and cryptographyWe show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization results). In particular, the main incarnation of this equivalence refers to ...






Comments