The Unique Games Theorem
Recorded by the registry's curators from GitHub; the authors did not submit it here.
OpenAI
We prove the Unique Games Conjecture. For every fixed \(\varepsilon,\delta\in(0,1/2)\), we give a deterministic polynomial-time reduction from \(\mathrm{3SAT}\) to Unique Games over a fixed finite alphabet, with completeness at least \(1-\varepsilon\) and soundness at most \(\delta\).
Claims
SOLUTION CLAIMED
OP-00733 — The Unique Games Conjecture
Files and sources
- Paper
- math @ 1581d4c, build/main.tex ↗
- Posted on GitHub
- 6 October 2026
No verification run is on record for this version.