72 citations · 94 across the 2 of their papers we have counts for
1 paper · 1 filter
Ryan O'Donnell, Michael Saks, Oded Schramm +1
We prove that for any decision tree calculating a boolean function f:{−1,1}n→{−1,1}, \[ \Var[f] \le \sum_{i=1}^n δ_i \Inf_i(f), \] where δi is the probability that the…