P
Initializing...
Proposition 2, p. 22 — every algorithm has E(R^{PLB}_{T₀}) ≥ C₀C_pT₀ on some PLB with ξ_t ∈ PB(ξ̃, C_p), C₀ depending only on ξ̃ · Prove2Me