skip to main content
article
Free Access

A new general derandomization method

Published:01 January 1998Publication History
Skip Abstract Section

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.

References

  1. 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 ScholarGoogle Scholar
  2. ANDREEV, A., CLEMENTI, A., AND ROLIM, J. 1996. Hitting properties of hard Boolean operators and their consequences on BPP. ECCC, TR96-055.Google ScholarGoogle Scholar
  3. 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 ScholarGoogle Scholar
  4. 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 ScholarGoogle Scholar
  5. 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 ScholarGoogle Scholar
  6. 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 ScholarGoogle Scholar
  7. BLUM, M., AND MICALI, S. 1984. How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13, 4, 850-864. Google ScholarGoogle Scholar
  8. 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 ScholarGoogle Scholar
  9. GOLDREICH, O. 1997. A sample of samplers: A computational perspective on sampling. In Electronic Colloquium on Computational Complexity (ECCC). TR97-20.Google ScholarGoogle Scholar
  10. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass. Google ScholarGoogle Scholar
  11. NISAN, N. 1990. Using hard problems to create pseudorandom generators, ACM distinguished dissertation. MIT Press, Cambridge, Mass. Google ScholarGoogle Scholar
  12. 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 ScholarGoogle Scholar
  13. NISAN, N., AND WIGDERSON, A. 1994. Hardness vs. randomness. J. Comput. Syst. Sci. 49, 149-167. Google ScholarGoogle Scholar
  14. PAPADIMITRIOU, C.H. 1993. Computational Complexity. Addison-Wesley, Reading, Mass.Google ScholarGoogle Scholar
  15. SAKS, M., SRINIVASAN, A., AND ZHOU, S. 1998. Explicit OR-dispersers with polylogarithmic degree. J. ACM 45, 1 (Jan.), 123-154. Google ScholarGoogle Scholar
  16. WEGEYER, I. 1987. The Complexity of Finite Boolean Functions. Wiley-Teubner Series in Computer Science. Wiley, New York. Google ScholarGoogle Scholar
  17. 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 ScholarGoogle Scholar
  18. 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 ScholarGoogle Scholar

Index Terms

  1. A new general derandomization method

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image Journal of the ACM
            Journal of the ACM  Volume 45, Issue 1
            Jan. 1998
            214 pages
            ISSN:0004-5411
            EISSN:1557-735X
            DOI:10.1145/273865
            Issue’s Table of Contents

            Copyright © 1998 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 January 1998
            Published in jacm Volume 45, Issue 1

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!