OpenAI reports perfect completeness for 2-to-1 games
- Theoretical Computer Science
For every fixed rational 0<δ<1, it is NP-hard to distinguish satisfiable 2-to-1 games from unweighted games of value at most δ, with an alphabet depending only on δ.
OpenAI reports perfect completeness for 2-to-1 games
- Theoretical Computer Science
For every fixed rational 0<δ<1, it is NP-hard to distinguish satisfiable 2-to-1 games from unweighted games of value at most δ, with an alphabet depending only on δ.
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
For every fixed rational 0<δ<1, it is NP-hard to distinguish satisfiable 2-to-1 games from unweighted games of value at most δ, with an alphabet depending only on δ.
Why it matters
If correct, settles the perfect-completeness 2-to-1 Games Conjecture, a central constraint-satisfaction hardness question.
What counts as progress
Is the stated gap NP-hard even when satisfiable games have value one?
Website timeline
Publication dates and editorial changes.