Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR02-048 | 31st July 2002 00:00

Almost $k$-wise independence versus $k$-wise independence

RSS-Feed

Abstract:


We say that a distribution over $\{0,1\}^n$
is almost $k$-wise independent
if its restriction to every $k$ coordinates results in a
distribution that is close to the uniform distribution.
A natural question regarding almost $k$-wise independent
distributions is how close they are to some $k$-wise
independent distribution. We show that the latter distance is
essentially $n^{\Theta(k)}$ times the former distance.



ISSN 1433-8092 | Imprint