2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DM2019
Towards a Proof of the Fourier--Entropy Conjecture?
Esty Kelman, Guy Kindler, Noam Lifshitz +2
The total influence of a function is a central notion in analysis of Boolean functions, and characterizing functions that have small total influence is one of the most fundamental…
cs.DM2015
On the Converse of Talagrand's Influence Inequality
Saleet Klein, Amit Levi, Muli Safra +2
In 1994, Talagrand showed a generalization of the celebrated KKL theorem. In this work, we prove that the converse of this generalization also holds. Namely, for any sequence of nu…
cs.DS2011★ 2 cited
Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity
Dana Ron, Ronitt Rubinfeld, Muli Safra +1
The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monot…