Ryan O'Donnell
Publishes 7 feeds
Analysis of Boolean Functions at CMU
15 posts · theirs
Graduate Complexity Theory at CMU
15 posts · theirs
Ryan O'Donnell Theoretical Computer Science Talks
15 posts · theirs
Undergrad Complexity Theory at CMU
15 posts · theirs
Great Ideas in Theoretical Computer Science at CMU (incomplete)
15 posts · theirs
CS Theory Toolkit at CMU
15 posts · theirs
Quantum Computation and Information at CMU
10 posts · theirs
Lately
Inequalities, asymptotics, primes || @ CMU || Homework 1 / Recitation 2 of CS Theory Toolkit
The Central Binomial Coefficient || @ CMU || Recitation 1 of CS Theory Toolkit
The Quantum Computing Advantage - Prof. Ryan O'Donnell
Great Ideas in Theoretical Computer Science: Introduction (Spring 2016) reupload with improved audio
Great Ideas in Theoretical Computer Science at CMU (incomplete) ·
Berry--Esseen Theorem || @ CMU || Lecture 4c of CS Theory Toolkit
Gaussian Random Variables || @ CMU || Lecture 4b of CS Theory Toolkit
Central Limit Theorem || @ CMU || Lecture 4a of CS Theory Toolkit
Binomial Coefficients Asymptotics || @ CMU || Lecture 3c of CS Theory Toolkit
Factorial Asymptotics, Stirling's Formula || @ CMU || Lecture 3b of CS Theory Toolkit
Birthday Paradox Asymptotics || @ CMU || Lecture 3a of CS Theory Toolkit
Asymptotics Tricks || @ CMU || Lecture 2c of CS Theory Toolkit
Ryan O'Donnell (CMU) -- Learning quantum states
Everything on this page was read from markup Ryan O'Donnell published — a rel="me" link, an h-card, or the feed’s own author element. Nothing was inferred from anywhere else. To correct or remove it, get in touch. Machine-readable: JSON