Polylogarithmic independence can fool DNF formulas

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 63-73

  Bazzi, Louay M J ^a  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

Author keywords

[No Author keywords available]

Indexed keywords

FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; RISK ASSESSMENT;

DNF FORMULAS; INDEPENDENCE (PERSONALITY); POLYLOGARITHMIC; PROBABILITY MEASURES;

COMPUTER SCIENCE;

EID: 46749137514     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389480     Document Type: Conference Paper

References (23)

1. J. Aspnes, R. Beigel, M. Beigel, and S. Rudich. The Expressive Power of Voting Polynomials. Combinatorica, 14(2): 135-148, 1994.
2. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple Constructions of Almost k-wise Independent Random Variables. Random Structures and Algorithms, 3(3):289-304, 1992.
3. N. Alon, O. Goldreich, Y. Mansour. Almost k-wise independence versus k-wise independence. In Electronic Colloquium on Computational Complexity, Report No. 48, 2002.
4. M. Ajtai and A. Wigderson. Deterministic Simulation of Probabilistic Constant Depth Circuits. In Proc. 26th IEEE Symposium on Foundations of Computer Science, pages 11-19, 1985.
5. Louay Bazzi. Minimum Distance of Error Correcting Codes versus Encoding Complexity, Symmetry, and Pseudorandomness. PhD. dissertation, MIT, Cambridge, Mass., 2003.
6. R. Beigel, N. Reingold, and D. Spielman, The Perceptron Strikes Back. In Proc. 6th Annual IEEE Conference on Structure in Complexity Theory, pages 286-291, 1991.
7. M. Blum and S. Micali. How to generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM journal on Computing, 13(4):850-864, 1984.
8. Johan Hastad. Computational Limitations for Small Depth Circuits. Ph.D. dissertation, MIT, Cambridge, Mass., 1986.
9. R. Impagliazzo and A. Wigderson. P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma. In Proc. 29th Annual ACM Symposium on the Theory of Computing, pages 220-229, 1997.
10. Michael Luby. A simple parallel algorithm for the maximal independent set problem. In Proc. 17th Annual ACM Symposium on the Theory of Computing, pages 1-10, 1985.
11. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform, and learnability. Journal of the Association for Computing Machinery, 40(3):607-620, 1993.
12. N. Linial and N. Nisan. Approximate inclusionexclusion. Combinatorica, 10(4):349-365, 1990.
13. M. Luby and B. Velickovic, On Deterministic Approximation of DNF. Algorithmica, 16(4/5):415-433, 1996.
14. M. Luby, B. Velickovic, and A. Wigderson. Deterministic approximate counting of depth-2 circuits. In Proceedings of the 2nd ISTCS, pages 18-24, 1993.
15. Noam Nisan. Pseudorandom bits for constant depth circuits. Combinatorica, 12(4):63-70, 1991.
16. J. Naor and M. Naor. Small bias probability spaces: efficient constructions and applications. SIAM J. on Computing, 22(4):838-856, 1993.
17. N. Nisan and M. Szegey. On the degree of Boolean functions as real polynomials. Computational Complexity, 4(4):301-313, 1994.
18. N. Nisan and A. Wigderson. Hardness vs. Randomness. In Proc. 29th IEEE Symposium on Foundations of Computer Science, pages 2-11, 1988.
19. Alexander Razborov. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mathematicheskie Zametki, 41(4):598-607, 1987.
20. Richard P. Stanely. Enumerative Combinatorics, Volume I. Cambridge University Press, 1997.
21. Luca Trevisan. A Note on Deterministic Approximate Counting for k-DNF. In Proc. of APPROX-RANDOM, pages 417-426, 2004.
22. Umesh Vazirani. Randomness, adversaries, and computation. PhD. dissertation, University of California, Berkeley, 1986.
23. Andrew C. Yao. Theory and application of Trapdoor functions. In Proc. 23rd IEEE Annual Symposium on Foundations of Computer Science, pages 80-91, 1982.