Polylogarithmic Independence Can Fool DNF Formulas

We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variables. Thus, for each constant e > 0, there is a constant c > 0 such that any boolean function computable by an m-clause DNF (or CNF) formula is m−e-fooled by any c log2 m-wise probability distribution. This resolves up to an O(log m) factor the depth-2 circuits case of a conjecture due to Linial and Nisan (1990). 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 PRG’s of O(log2 m log n)-seed length for m-clause DNF (or CNF) formulas on n variables, improving previously known seed lengths...

• Type: Conference
• Year: 2007
• Where: FOCS
• Authors: Louay Bazzi
• Keywords: Boolean Function, FOCS 2007, M-clause Dnf, Probability Distributions, Theoretical Computer Science