Inequalities, asymptotics, primes || @ CMU || Homework 1 / Recitation 2 of CS Theory Toolkit @RyanODonnellTeaching
Inequalities, asymptotics, primes || @ CMU || Homework 1 / Recitation 2 of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded January 2022 | Updated November 2026, 1 day ago
Recitation #2 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 by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Inequalities, asymptotics, primes || @ CMU || Homework 1 / Recitation 2 of CS Theory ToolkitETH 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 Toolkit
Ryan ODonnell |

Inequalities, asymptotics, primes || @ CMU || Homework 1 / Recitation 2 of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER