"Approximating the Influence of Monotone Boolean Functions in O(√n) ..."

Dana Ron et al. (2012)

> Home

Details and statistics

DOI: 10.1145/2382559.2382562

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/RonRSSW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/RonRSSW12
Dana Ron, Ronitt Rubinfeld, Muli Safra, Alex Samorodnitsky, Omri Weinstein:
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity. ACM Trans. Comput. Theory 4(4): 11:1-11:12 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.