ConceptTheory & Algos
Chernoff bound proof
A mathematical derivation establishing an upper bound on the tail probability of sums of independent random variables using Markov's inequality and exponential transformation.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
6The lectures that define it or assume it, and the concepts next to it.