On the Noise Sensitivity of Monotone Functions

Random Structures and Algorithms

Volumn 23, Issue 3, 2003, Pages 333-350

  Mossel, Elchanan ^a   O'Donnell, Ryan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141738444     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10097     Document Type: Article

References (19)

1. K. Athreya and P. Ney, Branching processes, Springer-Verlag, New York, Heidelberg, 1972.
2. I. Benjamini, G. Kalai, and O. Schramm, Noise sensitivity of boolean functions and applications to percolation, Inst Hautes Études Sci Publ Math 90 (1999), 5-43.
3. M. Ben-Or and N. Linial, "Collective coin flipping," Randomness and computation, S. Micali (Editor), Academic, New York, 1990, 91-115.
4. N. Bshouty and C. Tamon, On the Fourier spectrum of monotone functions, J ACM 43(4) (1996), 747-770.
5. N. Bshouty, J. Jackson, and T. Tamon, Uniform-distribution attribute noise learnability, Workshop on Computational Learning Theory, Santa-Cruz, CA, 1999, 75-80.
6. E. Friedgut, Boolean functions with low average sensitivity depend on few coordinates, Combinatorica 18(1) (1998), 27-36.
7. E. Friedgut and G. Kalai, Every monotone graph property has a sharp threshold, Proc Amer Math Soc 124 (1996), 2993-3002.
8. S. Hay kin, Neural networks, 2nd edition, Prentice Hall, Englewood Cliffs, NJ, 1999.
9. J. Kahn, G. Kalai, and N. Linial, The influence of variables on boolean functions, Found Comput Sci (1988), 68-80.
10. D. Kleitman, Families of non-disjoint subsets, J Combin Theory 1 (1966), 153-155.
11. N. Linial, Y. Mansour, and N. Nisan, Constant depth circuits, Fourier transform, and learnability, J ACM 40 (1993), 607-620.
12. Y. Mansour, Learning boolean functions via the Fourier transform, Theoretical advances in neural computing and learning, Kluwer Academic, Dordrecht, 1994, pp. 391-424.
13. E. Mossel, Recursive reconstruction on periodic trees, Random Structures Algorithms 13(1) (1998), 81-97.
14. R. O'Donnell, Hardness amplification within NP, Symp Theory of Computation, Montreal, Canada, 2002, 751-760.
15. C. Papadimitriou, Computational complexity, Addison Wesley, Reading, MA, 1993.
16. M. Talagrand, On Russo's approximate 0-1 law, Ann Probab 22(3) (1994), 1576-1587.
17. M. Talagrand, How much are increasing sets positively corelated? Combinatorica 16(2) (1996), 243-258.
18. M. Talagrand, On boundaries and influences, Combinatorica 17(2) (1997), 275-285.
19. L. Valiant, A theory of the learnable, Commun ACM 40(2) (1994), 445-474.