P

Initializing...

§3.2, p. 13, proof of Theorem 3.7 — tight instance: the bluff order is g_1 > ⋯ > g_5 and the bluff run gives A_1 = {g_1, g_3, g_5}, A_2 = {g_2, g_4} · Prove2Me