Unique Games Conjecture
A central conjecture in theoretical computer science concerning the inapproximability of constraint satisfaction problems. It is a strengthened form of the PCP theorem and, if true, would establish exact boundaries for optimal approximation algorithms for a large class of problems.
Timeline (last 90 days)
An AI system recently gave a positive proof of the Unique Games Conjecture.
OpenAI published a proof of the Unique Games Conjecture, declaring the conjecture to be true.
The Unique Games Conjecture is a core open problem in theoretical computer science that has remained unresolved for decades.
If the Unique Games Conjecture holds, it would provide exact boundaries for optimal approximation algorithms for a large class of constraint satisfaction problems.
The Unique Games Conjecture is a strengthened form of the PCP theorem, involving a special type of label cover instance.
The Unique Games Conjecture asserts that for any given parameter ε > 0, there exists a unique games instance such that distinguishing between "almost satisfiable" (for example, 1-ε satisfiable) and "almost unsatisfiable" (for example, ε satisfiable) is NP-hard.
Dor Minzer of MIT, Irit Dinur, and others proved the two-to-one games theorem, which is a weaker version of the Unique Games Conjecture.
Subhash Khot is the proposer of the Unique Games Conjecture.
All Facts (8)
Subhash Khot is the proposer of the Unique Games Conjecture.
50%UnverifiedThe Unique Games Conjecture asserts that for any given parameter ε > 0, there exists a unique games instance such that distinguishing between "almost satisfiable" (for example, 1-ε satisfiable) and "almost unsatisfiable" (for example, ε satisfiable) is NP-hard.
50%UnverifiedDor Minzer of MIT, Irit Dinur, and others proved the two-to-one games theorem, which is a weaker version of the Unique Games Conjecture.
50%UnverifiedThe Unique Games Conjecture is a core open problem in theoretical computer science that has remained unresolved for decades.
50%UnverifiedIf the Unique Games Conjecture holds, it would provide exact boundaries for optimal approximation algorithms for a large class of constraint satisfaction problems.
50%UnverifiedThe Unique Games Conjecture is a strengthened form of the PCP theorem, involving a special type of label cover instance.
50%UnverifiedOpenAI published a proof of the Unique Games Conjecture, declaring the conjecture to be true.
50%UnverifiedAn AI system recently gave a positive proof of the Unique Games Conjecture.
50%