Hardness of Random 3XOR and 3Sat || @ CMU || Lecture 26c of CS Theory Toolkit @RyanODonnellTeaching
Hardness of Random 3XOR and 3Sat || @ CMU || Lecture 26c of CS Theory Toolkit  @RyanODonnellTeaching
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/)
Hardness of Random 3XOR and 3Sat || @ CMU || Lecture 26c of CS Theory Toolkit#70/100: Tensor product || Quantum Computer Programming in 100 Easy Lessons#49/100: The No-Distinguishing Principle || Quantum Computer Programming in 100 Easy Lessons#80/100: Rotation Estimation: Birds-Eye View || Quantum Computer Programming in 100 Easy LessonsSpectral Graph Theory problems || @ CMU || Recitation 8 of CS Theory ToolkitLinear Programming: Optimization Reduces to Feasibility || @ CMU || Lecture 17d of CS Theory Toolkit#8/100: Path diagrams/matrices for instructions || Quantum Computer Programming in 100 Easy Lessons#26/100: Programming If f then Minus || Quantum Computer Programming in 100 Easy LessonsLinear Programming problems, and Convex Programming || @ CMU || Recitation 9 of CS Theory Toolkit#67/100: Rotation Estimation: n digits, 10ⁿ steps | Quantum Computer Programming in 100 Easy Lessons#63/100: Factor-1% Rotation Estimation loose ends | Quantum Computer Programming in 100 Easy Lessons#38/100: Every rotation is 2-D rotations || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Hardness of Random 3XOR and 3Sat || @ CMU || Lecture 26c of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER