Affiliation:
1. Microsoft Research New England, Cambridge, Massachusetts, Cambridge, MA
Abstract
We prove that poly-sized
AC
0
circuits cannot distinguish a polylogarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan [1990]. The only prior progress on the problem was by Bazzi [2007], who showed that
O
(log
2
n
)-independent distributions fool poly-size DNF formulas. [Razborov 2008] has later given a much simpler proof for Bazzi's theorem.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference12 articles.
1. Alon N. Goldreich O. and Mansour Y. 2002. Almost k-wise independence versus k-wise independence. In Electronic Colloquium on Computational Complexity. Report TR02-048. Alon N. Goldreich O. and Mansour Y. 2002. Almost k-wise independence versus k-wise independence. In Electronic Colloquium on Computational Complexity. Report TR02-048.
2. Smooth Histograms for Sliding Windows
3. Polylogarithmic Independence Can Fool DNF Formulas
4. The polynomial method in circuit complexity
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献