A guided tour of chernoff bounds
- 1 February 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (6), 305-308
- https://doi.org/10.1016/0020-0190(90)90214-i
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952