Polylogarithmic independence can fool DNF formulas

SIAM Journal on Computing

Volumn 38, Issue 6, 2009, Pages 2220-2272

  Bazzi, Louay M J ^a  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

Author keywords

DNF formulas; Harmonic analysis; Limited independence; Polynomial approximation; Posets; Pseudorandomness

Indexed keywords

BIAS PROPERTIES; CONJUNCTIVE NORMAL FORMS; DISJUNCTIVE NORMAL FORM; DNF FORMULAS; EXPLICIT CONSTRUCTIONS; INDEPENDENCE PROPERTIES; LARGE CLASS; LIMITED INDEPENDENCE; LOW DEGREE; POLYLOGARITHMIC; POSETS; PROBABILITY SPACES; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS;

BOOLEAN FUNCTIONS; CARBON NANOFIBERS; FOURIER SERIES; HARMONIC ANALYSIS; POLYNOMIAL APPROXIMATION;

PROBABILITY DISTRIBUTIONS;

EID: 65949108218     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070691954     Document Type: Article

References (27)

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.