Uploaded July 2020 | Updated November 2026, 2 hours ago
Sparse Parities with Noise and Håstad's 3XOR NP-hardness of approximation. Also, the hardness of random 3Sat, and Feige's Hypothesis.
Lecture 26c 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.
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/)
Sparse Parities with Noise and Håstad's 3XOR NP-hardness of approximation. Also, the hardness of random 3Sat, and Feige's Hypothesis.
Lecture 26c 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.
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/)










