TAOCP 7.2.2.2 Exercise 210

Working

taocpmathematicsalgorithmsvolume-4math-project

Section 7.2.2.2: Satisfiability

Exercise 210. [M36] But the result in the previous exercise can be improved when $k$ is large. Use the Local Lemma to show that every 7SAT problem with at most 13 occurrences of each variable is satisfiable.

Verified: no
Solve time: 6m32s

Working