P
Initializing...
Theorem 2.1, p. 8 — if D(P‖Q)/α = o(log n/n) with α bounded below, every algorithm has ℙ[β(π̂, π*) < α] → 1 · Prove2Me