Sciweavers

APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 6 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets