Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > MODULUS:
Reports tagged with modulus:
TR16-102 | 4th July 2016
Ravi Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola

Bounded independence vs. moduli

Revisions: 1

Let $k=k(n)$ be the largest integer such that there
exists a $k$-wise uniform distribution over $\zo^n$ that
is supported on the set $S_m := \{x \in \zo^n : \sum_i x_i \equiv 0 \bmod m\}$, where $m$ is any integer. We
show that \$\Omega(n/m^2 \log m) \le k \le 2n/m + ... more >>>

ISSN 1433-8092 | Imprint