• DocumentCode
    3267649
  • Title

    Poly-logarithmic Independence Fools AC^0 Circuits

  • Author

    Braverman, Mark

  • Author_Institution
    Microsoft Res. New England, Cambridge, MA, USA
  • fYear
    2009
  • fDate
    15-18 July 2009
  • Firstpage
    3
  • Lastpage
    8
  • Abstract
    We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan [LN90]. The only prior progress on the problem was by Bazzi [Baz07], who showed that O(log2n)-independent distributions fool poly-size DNF formulas. Razborov [Raz08] has later given a much simpler proof for Bazzipsilas theorem.
  • Keywords
    circuit complexity; statistical distributions; Bazzi theorem proof; poly-logarithmically independent distribution; poly-size DNF formula; poly-sized AC0 circuit complexity; Boolean functions; Circuits; Computational complexity; Distributed computing; Drives; Linear code; Polynomials; USA Councils; circuit complexity; polynomial approximation; pseudorandomness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2009. CCC '09. 24th Annual IEEE Conference on
  • Conference_Location
    Paris
  • ISSN
    1093-0159
  • Print_ISBN
    978-0-7695-3717-7
  • Type

    conf

  • DOI
    10.1109/CCC.2009.35
  • Filename
    5231177
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3267649