ETH False @RyanODonnellTeaching
ETH False  @RyanODonnellTeaching
Uploaded October 2026 | Updated November 2026, 3 hours ago
Lecture 18 in Ryan O'Donnell's Graduate Computational Complexity course at Carnegie Mellon University.
ETH False#62/100: 1-qubit Rotation Estimation to factor 2 || Quantum Computer Programming in 100 Easy LessonsThe SDP Relaxation for Max-Cut || @ CMU || Lecture 19b of CS Theory Toolkit#84/100: Factoring Algorithm: the overview || Quantum Computer Programming in 100 Easy LessonsLinear Programming Duality || @ CMU || Lecture 17b of CS Theory ToolkitThe Switching Lemma#6/100: Creating and destroying qubits || Quantum Computer Programming in 100 Easy LessonsEntropy || @ CMU || Lecture 24a of CS Theory ToolkitExpander Graph Application 2: Derandomization || @ CMU || Lecture 16c of CS Theory ToolkitHardness Assumptions Beyond NP ≠ P || @ CMU || Lecture 26a of CS Theory ToolkitDinurs proof of the PCP Theorem: the Powering step || @ CMU || Lecture 27d of CS Theory ToolkitFrom One-Way Functions to Symmetric Key Encryption || @ CMU || Lecture 25c of CS Theory Toolkit
Ryan ODonnell |

ETH False

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER