Sciweavers

ECCC
2002
90views more  ECCC 2002»
13 years 4 months ago
Almost k-wise independence versus k-wise independence
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...
Noga Alon, Oded Goldreich, Yishay Mansour
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
13 years 11 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...
Mark Braverman