ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR09-011 | 31st January 2009 00:00

Poly-logarithmic independence fools AC0 circuits

RSS-Feed




TR09-011
Authors: Mark Braverman
Publication: 5th February 2009 19:59
Downloads: 1386
Keywords: 


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(log^2 n)-independent distributions fool poly-size DNF formulas. Razborov [Raz08] has later given a much simpler proof for Bazzi's theorem.



ISSN 1433-8092 | Imprint