355. [HM21] In (152), prove that Ej ≤ 1/δ when (p1, . . . , pm) has positive slack δ. Hint: Consider replacing pj by pj + δpj.
356. [M33] (The Clique Local Lemma.) Let G be a graph on {1, . . . , m}, and let G | U1, . . . , G | Ut be cliques that cover all the edges of G. Assign numbers θij ≥ 0 to the vertices of each Uj, such that Σj = ∑i ∈ U j θij < 1. Assume that
a) Prove that (p1, . . . , pm) ∈ R(G). Hint: Letting denote , show that
b) Also ...
Get The Art of Computer Programming: Satisfiability, Volume 4, Fascicle 6 now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.