Salvador: Approximate Vertex Cover Solver
-
Updated
Oct 17, 2026 - Python
Salvador: Approximate Vertex Cover Solver
SatyPy: SAT Solver through Minimum Independent Dominating Set
Certified computational study of the gap shape of degree-4 sum-of-squares relaxations of unique games. A null result on the main question, two proved theorems on Paley graphs, and a structural determination of the degree-4 extension. Fully reproducible: 132 checks, 0 mismatches.
The Unique Games Theorem: an 11-page self-contained proof and a 17-page faithful presentation of OpenAI's proof (Zenodo DOIs inside)
To associate your repository with the unique-games-conjecture topic, visit your repo's landing page and select "manage topics."