Unique games conjecture
Is approximating Unique Games NP-hard?
Summary
If true, it would fix the best possible approximation guarantees for a wide range of optimisation problems.
Source
Open, as listed by Wikipedia · Unsolved problems in computer science. Checked 29 Sep 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.
