Unique Games Conjecture

Concept

A problem in theoretical computer science, a strengthening of the PCP theorem, whose truth implies optimal hardness of approximation for many constraint satisfaction problems.

Mentioned in 1 video

Videos Mentioning Unique Games Conjecture

AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory | Lex Fridman Podcast #503

AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory | Lex Fridman Podcast #503

Lex Fridman

A problem in theoretical computer science, a strengthening of the PCP theorem, whose truth implies optimal hardness of approximation for many constraint satisfaction problems.