Uploaded July 2020 | Updated November 2026, 2 hours ago
The powerful theorems on NP-hardness of approximation: Raz and Raz--Moshkovitz's Label-Cover hardness, and a discussion of Unique Games. Lecture 26e of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resource for this lecture:
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
The powerful theorems on NP-hardness of approximation: Raz and Raz--Moshkovitz's Label-Cover hardness, and a discussion of Unique Games. Lecture 26e of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resource for this lecture:
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)










