A Simple Proof of Bazzi’s Theorem
ACM Transactions on Computation Theory (TOCT)
Polylogarithmic independence fools AC0 circuits
Journal of the ACM (JACM)
Patterns hidden from simple algorithms: technical perspective
Communications of the ACM
Poly-logarithmic independence fools bounded-depth boolean circuits
Communications of the ACM
Pseudorandom generators for combinatorial shapes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.03 |
We show that any $k$-wise independent probability distribution on $\{0,1\}^n$ $O(m^{2.2}$ $2^{-\sqrt{k}/10})$-fools any boolean function computable by an $m$-clause disjunctive normal form (DNF) (or conjunctive normal form (CNF)) formula on $n$ variables. Thus, for each constant $e0$, there is a constant $c0$ such that any boolean function computable by an $m$-clause DNF (or CNF) formula is $m^{-e}$-fooled by any $c\log^2m$-wise probability distribution. This resolves up to an $O(\log m)$ factor the depth-2 circuit case of a conjecture due to Linial and Nisan [Combinatorica, 10 (1990), pp. 349-365]. The result is equivalent to a new characterization of DNF (or CNF) formulas by low degree polynomials. It implies a similar statement for probability distributions with the small bias property. Using known explicit constructions of small probability spaces having the limited independence property or the small bias property, we directly obtain a large class of explicit pseudorandom generators of $O(\log^2m\log n)$-seed length for $m$-clause DNF (or CNF) formulas on $n$ variables, improving previously known seed lengths.