Abstract

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 $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\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.

MSC codes

  1. 06A07
  2. 42B05
  3. 60C05
  4. 60E15
  5. 68R05
  6. 68W20

Keywords

  1. limited independence
  2. DNF formulas
  3. harmonic analysis
  4. posets
  5. pseudorandomness
  6. polynomial approximation

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
J. Aspnes, R. Beigel, M. Furst, and S. Rudich, The expressive power of voting polynomials, Combinatorica, 14 (1994), pp. 135–148.
2.
N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple constructions of almost k-wise independent random variables, Random Structures Algorithms, 3 (1992), pp. 289–304.
3.
N. Alon, O. Goldreich, and Y. Mansour, Almost k-wise independence versus k-wise independence, Inform. Process. Lett., 88 (2003), pp. 107–110.
4.
M. Ajtai and A. Wigderson, Deterministic simulation of probabilistic constant depth circuits, in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 11–19.
5.
L. Bazzi, Minimum Distance of Error Correcting Codes versus Encoding Complexity, Symmetry, and Pseudorandomness, Ph.D. dissertation, MIT, Cambridge, MA, 2003.
6.
L. Bazzi, Polylogarithmic independence can fool DNF formulas, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007, pp. 63–73.
7.
R. Beigel, N. Reingold, and D. Spielman, The perceptron strikes back, in Proceedings of the 6th Annual IEEE Conference on Structure in Complexity Theory, 1991, pp. 286–291.
8.
M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput., 13 (1984), pp. 850–864.
9.
J. Hastad, Computational Limitations for Small Depth Circuits, Ph.D. dissertation, MIT, Cambridge, MA, 1986.
10.
R. Impagliazzo and A. Wigderson, P $=$ BPP if E requires exponential circuits: Derandomizing the XOR lemma, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 220–229.
11.
J. Kahn, G. Kalai, and N. Linial, The influence of variables on Boolean functions, in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 68–80.
12.
R. J. Lechner, Harmonic analysis of switching functions, in Recent Development in Switching Theory, Academic Press, New York, 1971, pp. 121–228.
13.
N. Linial, Y. Mansour, and N. Nisan, Constant depth circuits, Fourier transform, and learnability, J. ACM, 40 (1993), pp. 607–620.
14.
N. Linial and N. Nisan, Approximate inclusion-exclusion, Combinatorica, 10 (1990), pp. 349–365.
15.
M. Luby, A simple parallel algorithm for the maximal independent set problem, in Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 1–10.
16.
M. Luby and B. Velickovic, On deterministic approximation of DNF, Algorithmica, 16 (1996), pp. 415–433.
17.
M. Luby, B. Velickovic, and A. Wigderson, Deterministic approximate counting of depth-2 circuits, in Proceedings of the 2nd Israel Symposium on the Theory and Computing Systems, 1993, pp. 18–24.
18.
J. Naor and M. Naor, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838–856.
19.
N. Nisan, Pseudorandom bits for constant depth circuits, Combinatorica, 12 (1991), pp. 63–70.
20.
N. Nisan and M. Szegey, On the degree of Boolean functions as real polynomials, Comput. Complexity, 4 (1994), pp. 301–313.
21.
N. Nisan and A. Wigderson, Hardness vs. randomness, in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 2–11.
22.
A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Math. Zametki, 41 (1987), pp. 598–607.
23.
A. Razborov, A Simple Proof of Bazzi's Theorem, Report TR08-081, Electronic Colloquium on Computational Complexity, 2008.
24.
R. P. Stanely, Enumerative Combinatorics, Vol. I, Cambridge University Press, Cambridge, UK, 1997.
25.
L. Trevisan, A note on deterministic approximate counting for k-DNF, in Proceedings of the APPROX-RANDOM, 2004, pp. 417–426.
26.
U. Vazirani, Randomness, Adversaries, and Computation, Ph.D. dissertation, University of California, Berkeley, CA, 1986.
27.
A. C. Yao, Theory and applications of trapdoor functions, in Proceedings of the 23rd IEEE Annual Symposium on Foundations of Computer Science, 1982, pp. 80–91.

Information & Authors

Information

Published In

cover image SIAM Journal on Computing
SIAM Journal on Computing
Pages: 2220 - 2272
ISSN (online): 1095-7111

History

Submitted: 18 May 2007
Accepted: 24 September 2008
Published online: 4 March 2009

MSC codes

  1. 06A07
  2. 42B05
  3. 60C05
  4. 60E15
  5. 68R05
  6. 68W20

Keywords

  1. limited independence
  2. DNF formulas
  3. harmonic analysis
  4. posets
  5. pseudorandomness
  6. polynomial approximation

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

View Options

View options

PDF

View PDF

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media

On May 28, 2024, our site will enter Read Only mode for a limited time in order to complete a platform upgrade. As a result, the following functions will be temporarily unavailable: registering new user accounts, any updates to existing user accounts, access token activations, and shopping cart transactions. Contact [email protected] with any questions.