The Unique Games Theorem
For every fixed , there are an integer and a deterministic polynomial-time reduction from 3SAT to explicit unweighted simple bipartite Unique Games instances over with translation constraints such that satisfiable implies and unsatisfiable implies , where the alphabet, running-time polynomial degree, and constants depend only on .
The proof in Section 7.2 carefully tracks the quantifier order, rational parameter choices, and polynomial-time explicitness of the reduction.
“For every fixed ε, δ ∈ (0, 1/2), there are an integer s ≥ 1 and a deterministic polynomial-time reduction from 3SAT to explicit unweighted Unique Games instances Gφ over K = F s 2 such that φ satisfiable =⇒ val(Gφ) ≥ 1 − ε, φ unsatisfiable =⇒ val(Gφ) ≤ δ. The graph is simple and bipartite, and every constraint is a translation a(ve) = a(ue) + ce of K. The alphabet, the degree of the running-time polynomial, and its constants depend only on ε, δ.” · Show in paper