Sciweavers

COCO
2009
Springer

Poly-logarithmic Independence Fools AC0 Circuits

14 years 5 months ago
Poly-logarithmic Independence Fools AC0 Circuits
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, Baz09], who showed that O(log2 n)-independent distributions fool poly-size DNF formulas. Razborov [Raz08] has later given a much simpler proof for Bazzi’s theorem.
Mark Braverman
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where COCO
Authors Mark Braverman
Comments (0)