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

Matt Franklin: In the proof of Theorem 8.66 (middle of p. 225 in book), the...Matt Franklin: The "Condorcet Jury Theorem" is discussed but not named in t...Matt Franklin: In the first line of the proof of Proposition 8.45 (bottom o...Ryan O'Donnell: Great catch, thanks!Ryan O'Donnell: Thanks! The proofreader should have caught those!Ryan O'Donnell: Thanks -- I think that kind of parenthesis-free notation for...Ryan O'Donnell: Thanks! Unique Games is discussed somewhat in Chapter 7 of ...