Hardest problems in complexity - explained by mathematician | Lex Fridman
Lex Clips · 5:48 · Watch on YouTube
The video explains why SAT is central to complexity theory and how the PCP theorem and Unique Games Conjecture turn exact hardness into robust hardness of approximation.