skip to main content
research-article

A Simple Proof of Bazzi’s Theorem

Published:01 February 2009Publication History
Skip Abstract Section

Abstract

Linial and Nisan [1990] asked if any polylog-wise independent distribution fools any function in AC0. In a recent remarkable development, Bazzi solved this problem for the case of DNF formulas. The aim of this note is to present a simplified version of his proof.

References

  1. Aspnes, J., Beigel, R., Furst, M., and Rudich, S. 1994. The expressive power of voting polynomials. Combinatorica 14, 2, 1--14.Google ScholarGoogle ScholarCross RefCross Ref
  2. Bazzi, L. 2008. Polylogarithmic independence can fool DNF formulas. SIAM J. Comput., to appear (http://www.mit.edu/~louay/recent/kwisednf2.pdf). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Beigel, R., Reingold, N., and Spielman, D. 1991. The perceptron strikes back. In Proceedings of the 6th IEEE Conference on Structure in Complexity Theory, IEEE Computer Society Press, Los Alamitos, CA, 286--291.Google ScholarGoogle Scholar
  4. Linial, N., Mansour, Y., and Nisan, N. 1993. Constant depth circuits, Fourier transforms and learnability. J. ACM 40, 3, 607--620. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Linial, N. and Nisan, N. 1990. Approximate inclusion-exclusion. Combinatorica 10, 4, 349--365.Google ScholarGoogle ScholarCross RefCross Ref
  6. Luby, M. and Velickovic, B. 1996. On deterministic approximation of DNF. Algorithmica 16, 4/5, 415--433.Google ScholarGoogle Scholar

Index Terms

  1. A Simple Proof of Bazzi’s Theorem

    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 ACM Transactions on Computation Theory
      ACM Transactions on Computation Theory  Volume 1, Issue 1
      February 2009
      78 pages
      ISSN:1942-3454
      EISSN:1942-3462
      DOI:10.1145/1490270
      Issue’s Table of Contents

      Copyright © 2009 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 February 2009
      Published in toct Volume 1, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    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!