6 search results - page 1 / 2 » Polylogarithmic Independence Can Fool DNF Formulas |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
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 variable...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
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...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
COLT
1993
Springer
13 years 9 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...