λEnter Calculus CompanionRegistered manuscripts, kept distinct

Manuscript Psy04-B@1 · Psy04-B-v1.tex · section · 62c2b6f0

Finite capacity and certified optimization

Finite capacity and certified optimization · lines 2251–2257

Back to manuscript

Let $X$ now contain $n$ fresh uniform bits, let the late query be uniform on ${1, \dots, n}$ , and let the classical cut admit $K \geq 1$ states.

Nearby in this section