In Theorem 36 we saw that it is $\mathsf{NP}$-hard to $(1-\delta_0, 1)$-approximate Max-E$3$Sat for some positive but inexplicit constant $\delta_0$. You might wonder how large $\delta_0$ can be. The natural limit here is $\frac18$ because there is a very simple algorithm which satisfies a $\frac78$-fraction of the constraints in any Max-E$3$Sat instance:

[...]

## Recent comments

Ohad Klein: Are the indexing in (the start of) 7 OK?Ohad Klein: "learning algorithm running in time in time"Amir: In the proof of Theorem 16, and in the equation immediately ...Ohad Klein: In example 6, should "of codimension less than n" be "of pos...Ohad Klein: In 15c (18c in the book), I think it should be $\cap_j{V_j}$...Ohad Klein: Bracket typo: In the proof of thm 10 (12 in the book), $sgn(...Ohad Klein: Oops, my bad.