Approximating the influence of monotone Boolean functions in O(√n) query complexity

ACM Transactions on Computation Theory

Volumn 4, Issue 4, 2012, Pages

  Ron, Dana ^a   Rubinfeld, Ronit ^a   Safra, Muli ^a   Samorodnitsky, Alex ^b   Weinstein, Omri ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

Influence of a Boolean function; Sublinear query approximation algorithms; Symmetric chains

Indexed keywords

A-MONOTONE; AVERAGE SENSITIVITIES; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DISCRETE FUNCTIONS; GENERAL FUNCTIONS; LOWER BOUNDS; MONOTONE BOOLEAN FUNCTIONS; MULTIPLICATIVE FACTORS; QUERY COMPLEXITY; RANDOMIZED ALGORITHMS; SAMPLING ALGORITHM; SUB-LINEAR QUERIES;

APPROXIMATION ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 84870691494     PISSN: 19423454     EISSN: 19423462     Source Type: Journal    
DOI: 10.1145/2382559.2382562     Document Type: Article

References (41)

1. ARROW, K. 1950. A difficulty in the theory of social welfare. J. Polit. Econ. 58, 328-346.
2. BENJAMINI, I., KALAI, G., AND SCHRAMM, O. 1999. Noise sensitivity of Boolean functions and applications to percolation. Inst. Hautes Etudes Sci. Publ. Math. 90, 5-43.
3. BEN-OR, M. AND LINIAL, N. 1985. Collective coin flipping, robust voting schemes and minima of Banzhaf values. In Proceedings of FOCS. 408-416. (Pubitemid 16541439)
4. BLAIS, E. 2008. Improved bounds for testing juntas. In Proceedings of RANDOM. 317-330.
5. BLAIS, E. 2009. Testing juntas nearly optimally. In Proceedings of STOC. 151-158.
6. BLAIS, E., BRODY, J., AND MATULEF, K. 2011. Property testing lower bounds via communication complexity. In Proceedings of the 26th Annual Conference on Computational Complexity (CCC).
7. BOPPANA, R. 1997. The average sensitivity of bounded depth circuits. Inform. Process. Lett. 63, 257-261. (Pubitemid 127403907)
8. BOURGAIN, J. AND KALAI, G. 1997. Influences of variables and threshold intervals under group symmetries. Geom. Funct. Anal. 7, 438-461.
9. BOURGAIN, J., KAHN, J., KALAI, G., KATZNELSON, Y., AND LINIAL, N. 1992. The influence of variables in product spaces. Israel J. Math. 77, 55-64.
10. BSHOUTY, N. AND TAMON, C. 1996. On the Fourier spectrum of monotone functions. J. ACM 43, 4, 747-770. (Pubitemid 126582612)
11. DIAKONIKOLAS, I., HARSHA, P., KLIVANS, A., MEKA, R., RAGHAVENDRA, P., SERVEDIO, R., AND TAN, L.-Y. 2010. Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. In Proceedings of STOC. 533-543.
12. DILWORTH, R. P. 1950. A decomposition theorem for partially ordered sets. Annals Math. 51, 1, 161-166.
13. DINUR, I. AND SAFRA, S. 2002. The importance of being biased. In Proceedings of STOC. 33-42. (Pubitemid 35009358)
14. DINUR, I., FRIEDGUT, E., KINDLER, G., AND O'DONNELL, R. 2007. On the Fourier tails of bounded functions over the discrete cube. Israel J. Math. 160, 1, 389-412.
15. FISCHER, E., LEHMAN, E., NEWMAN, I., RASKHODNIKOVA, S., RUBINFELD, R., AND SAMORODNITSKY, A. 2002. Monotonicity testing over general poset domains. In Proceedings of STOC. 474-483. (Pubitemid 35009408)
16. FISCHER, E., KINDLER, G., RON, D., SAFRA, S., AND SAMORODNITSKY, S. 2004. Testing juntas. J. Comput. Syst. Sci. 68, 4, 753-787.
17. FRIEDGUT, E. 1998. Boolean functions with low average sensitivity depend on few coordinates. Combinatorica 18, 1, 27-36. (Pubitemid 128137340)
18. FRIEDGUT, E. 2004. Influences in product spaces: KKL, BKKKL revisited. Combinatorics Probab. Comput. 13, 17-29.
19. FRIEDGUT, E. AND KALAI, G. 1996. Every monotone graph property has a sharp threshold. Proc. Amer. Math. Soc. 124, 2993-3002.
20. GOLDREICH, O., GOLDWASSER, S., LEHMAN, E., RON, D., AND SAMORODNITSKY, A. 2000. Testing monotonicity. Combinatorica 20, 3, 301-337.
21. GREENE, C. AND KLEITMAN, D. J. 1976. Strong version of Sperner's theorem. J. Combinatorial Theory Ser. A 20, 1, 80-88.
22. HANCOCK, T. AND MANSOUR, Y. 1991. Learning monotone k-μ DNF formulas on product distributions. In Proceedings of COLT. 179-183.
23. KALAI, G. 2002. A Fourier-theoretic perspective for the Condorcet Paradox and Arrow's Theorem. Advances Appl. Math. 29, 412-426. (Pubitemid 36100527)
24. KALAI, G. 2004. Social indeterminacy. Econometrica 72, 1565-1581.
25. KALAI, G. AND SAFRA, S. 2006. Threshold phenomena and influence. Computat. Complexity Statist. Phys., 25-60.
26. KALAI, G., KAHN, J., AND LINIAL, N. 1988. The influence of variables on Boolean functions. In Proceedings of FOCS. 68-80.
27. KALAIANDS, G. AND SAFRA, S. 2006. Threshold phenomena and influence. Computat. Complexity Statist. Phys. 25-60.
28. KHOT, S. 2002. On the power of unique 2-prover 1-round games. In Proceedings of STOC. 767-775. (Pubitemid 35009440)
29. KRIVELEVICH, M., SUDAKOV, B., AND VU, V. H. 2002. A sharp threshold for network reliability. Combinatorics, Probabil. Comput. 11, 465-474.
30. LEHRER, E. 1988. An axiomatization of the Banzhaf value. Intern. J. Game Theory 17, 89-99.
31. LINIAL, N., MANSOUR, Y., AND NISAN, N. 1993. Constant depth circuits, Fourier transform, and learnability. J. ACM 40, 3, 607-620. (Pubitemid 23707885)
32. MATULEF, K., O'DONNELL, R., RUBINFED, R., AND SERVEDIO, R. A. 2009a. Testing {-1, +1} halfspaces. In Proceedings of RANDOM. 646-657.
33. O'DONNELL, R. AND SERVEDIO, R. 2007. Learning monotone decision trees in polynomial time. SIAM J. Comput. 37, 3, 827-844.
34. O'DONNELL, R. AND SERVEDIO, R. 2011. The Chow parameters problem. SIAM J. Comput. 40, 1, 165-199.
35. O'DONNELL, R., SAKS, M., SCHRAMM, O., AND SERVEDIO, R. 2005. Every decision tree has an influential variable. In Proceedings of FOCS. 31-39. (Pubitemid 44375717)
36. RON, D. AND TSUR, G. 2012. Testing computability by width-2 OBDDs. Theoret. Comput. Sci. 420, 64-79.
37. RON, D., RUBINFELD, R., SAFRA, M., AND WEINSTEIN, O. 2011. Approximating the influence of a monotone Boolean function in O (vn) query complexity. Tech. rep., arXiv:1101.5345.
38. RUSSO, L. 1981. On the critical percolation probabilities. Z. Wahrsch. Verw. Geb. 56, 229-237.
39. TALAGRAND, M. 1994. On Russo's approximate 0-1 law. In Annals of Probability, 22, 1576-1587.
40. TALAGRAND, M. 1996. How much are increasing sets correlated. Combinatorica 16, 243-258.
41. TALAGRAND, M. 1997. On boundaries and influences. Combinatorica 17, 275-285. (Pubitemid 127340024)