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

Ryan O'Donnell: Yes, thanks!Dmitry Sokolov: Exercise 28. Maybe $A \in \{-1, 1\}$ istead of $A \in \mathb...Ryan O'Donnell: Fixed, thanks!Ryan O'Donnell: It's the Holder conjugate of $q$ (i.e., the number satisfyin...Gautam Kamath: Is $q'$ defined here?Gautam Kamath: On this page, Hölder is displaying for me as H{ö}lder - is t...Ryan O'Donnell: Yes, you're right. This is not a well-written proof by the ...