Sign inSign in

Unique games conjecture

A conjecture stating that for all delta, it is NP-hard to distinguish between Label-Cover instances where almost all constraints can be satisfied versus instances where at most a delta fraction can be satisfied, even when the projection constraints are bijections.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 5 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Avi Wigderson

    Institute for Advanced Study · Undergraduate

    A conjecture stating that certain two-prover games are NP-complete to distinguish, which implies optimal hardness results for many approximation problems.
    • 32:41Mathematics and Computation: The Landscape of P vs. NP
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A conjecture stating that for all epsilon greater than zero, there is a large enough Q such that even given a 1-epsilon satisfiable instance of max-bisection, it is NP-hard to find an assignment satisfying even an epsilon fraction of the constraints.
    • 31:00CSP Approximability: Optimization and Certification
    • 1:10:35Constraint Satisfaction Problems
  • John Wright

    Carnegie Mellon University · Research

    A constraint satisfaction problem parameterized by a positive integer q where all allowed constraints are two-variable bijective constraints.
    • 0:28UG-Hardness Results from Dictator Tests

Lectures that assume it

2

Connections

15

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.