论文信息 - A Guided Tour of Chernoff Bounds - 字舞流文

A Guided Tour of Chernoff Bounds

Torben Hagerup | Christine Rüb | T. Hagerup | Christine Rüb

[1] Micha Hofri,et al. Probabilistic Analysis of Algorithms , 1987, Texts and Monographs in Computer Science.

[2] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[3] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.

[4] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[5] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .

[6] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .