메뉴 건너뛰기




Volumn 18, Issue 1, 1998, Pages 27-35

Boolean functions with low average sensitivity depend on few coordinates

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0032423576     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009809     Document Type: Article
Times cited : (192)

References (12)
  • 1
    • 0000898117 scopus 로고
    • Inequalities in Fourier analysis
    • W. BECKNER: Inequalities in Fourier analysis, Annals of Mathematics, 102 (1975), 159-182.
    • (1975) Annals of Mathematics , vol.102 , pp. 159-182
    • Beckner, W.1
  • 2
    • 0002897287 scopus 로고
    • Collective coin flipping
    • (S. Micali, ed.), Academic Press, New York
    • M. BEN-OR and N. LINIAL: Collective coin flipping, in Randomness and Computation (S. Micali, ed.), Academic Press, New York, 1990, 91-115; earlier version: Collective coin flipping, robust voting games, and minima of Banzhaf value, Proc. 26th IEEE Symp. on the Foundation of Computer Science, 1985, 408-416.
    • (1990) Randomness and Computation , pp. 91-115
    • Ben-Or, M.1    Linial, N.2
  • 3
    • 0013536480 scopus 로고
    • M. BEN-OR and N. LINIAL: Collective coin flipping, in Randomness and Computation (S. Micali, ed.), Academic Press, New York, 1990, 91-115; earlier version: Collective coin flipping, robust voting games, and minima of Banzhaf value, Proc. 26th IEEE Symp. on the Foundation of Computer Science, 1985, 408-416.
    • (1985) Proc. 26th IEEE Symp. on the Foundation of Computer Science , pp. 408-416
  • 5
    • 13744252028 scopus 로고    scopus 로고
    • Every monotone graph property has a sharp threshold
    • E. FRIEDGUT and G. KALAI: Every monotone graph property has a sharp threshold, Proc. Amer. Math. Soc., 124 (1996), 2993-3002.
    • (1996) Proc. Amer. Math. Soc. , vol.124 , pp. 2993-3002
    • Friedgut, E.1    Kalai, G.2
  • 7
    • 0002577888 scopus 로고
    • Probabilistic characteristics of graphs with large connectivity
    • G. MARGULIS: Probabilistic characteristics of graphs with large connectivity, Prob. Peredachi Inform., 10 (1974), 101-108.
    • (1974) Prob. Peredachi Inform. , vol.10 , pp. 101-108
    • Margulis, G.1
  • 8
    • 0000607672 scopus 로고
    • On the degree of Boolean functions as real polynomials
    • N. NISAN and M. SZEGEDY: On the Degree of Boolean Functions as Real Polynomials, Computational Complexity, 4 (1994), 301-313.
    • (1994) Computational Complexity , vol.4 , pp. 301-313
    • Nisan, N.1    Szegedy, M.2
  • 9
    • 34250275869 scopus 로고
    • On the critical percolation probabilities
    • L. RUSSO: On the critical percolation probabilities, Z. Wahrsch. werw. Gebiete, 43 (1978), 39-48.
    • (1978) Z. Wahrsch. Werw. Gebiete , vol.43 , pp. 39-48
    • Russo, L.1
  • 10
    • 0000495093 scopus 로고
    • An approximate zero-one law
    • L. RUSSO: An approximate zero-one law, Z. Wahrsch. werw. Gebiete, 61 (1982), 129-139.
    • (1982) Z. Wahrsch. Werw. Gebiete , vol.61 , pp. 129-139
    • Russo, L.1
  • 11
    • 51249176947 scopus 로고
    • A threshold for perfect matchings in random d-pure hypergraphs
    • J. SCHMIDT-PRUZAN and E. SHAMIR: A threshold for perfect matchings in random d-pure hypergraphs, Combinatorica, 5 (1985) 81-94.
    • (1985) Combinatorica , vol.5 , pp. 81-94
    • Schmidt-Pruzan, J.1    Shamir, E.2
  • 12
    • 0000055593 scopus 로고
    • On Russo's approximate 0-1 law
    • M. TALAGRAND: On Russo's approximate 0-1 law, The Annals of Probability, 1994, Vol. 22 No. 3 1576-1587.
    • (1994) The Annals of Probability , vol.22 , Issue.3 , pp. 1576-1587
    • Talagrand, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.