Ryan O'Donnell Courses

Great Ideas in Theoretical Computer Science - Polynomials

Explore theoretical computer science with Ryan O'Donnell, focusing on polynomials, including their addition, multiplication, division, and application in error correcting codes. (1-2hr workload)

• YouTube
• 1 hour 15 minutes
• On-Demand
• Free Online Course

Great Ideas in Theoretical Computer Science: Computability

Explore theoretical computer science with Ryan O'Donnell, focusing on computability, Turing machines, and the Church-Turing Thesis. Expect 1-2 hours of material.

• YouTube
• 1 hour 19 minutes
• On-Demand
• Free Online Course

Great Ideas in Theoretical Computer Science - On Proofs

Explore theoretical computer science with Ryan O'Donnell, focusing on proofs, their history, and techniques for finding them. Expect a 1-2 hour workload.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Online Course

Great Ideas in Theoretical Computer Science - Graphs - The Basics

Explore the basics of graphs in theoretical computer science with Ryan O'Donnell. This 1-2 hour material covers definitions, regular graphs, perfect matching, and more.

• YouTube
• 1 hour 20 minutes
• On-Demand
• Free Online Course

Great Ideas in Theoretical Computer Science - Approximation Algorithms

Explore theoretical computer science with Ryan O'Donnell's online material, focusing on approximation algorithms. Expect 1-2 hours of study.

• YouTube
• 1 hour 20 minutes
• On-Demand
• Free Online Course

Analysis of Boolean Functions at CMU - Additive Combinatorics

Explore additive combinatorics in Boolean functions with this CMU graduate-level material, taught by Ryan O'Donnell. Expect a 1-2 hour workload.

• YouTube
• 1 hour 22 minutes
• On-Demand
• Free Online Course

Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems

Dive into Boolean Functions Analysis with Ryan O'Donnell at CMU. Learn about constraint satisfaction problems, approximation algorithms, and more in 1-2 hours weekly.

• YouTube
• 1 hour 15 minutes
• On-Demand
• Free Online Course

Analysis of Boolean Functions - Restrictions and the Goldreich-Levin Theorem

Explore Boolean functions with Ryan O'Donnell at CMU. Dive into restrictions, the Goldreich-Levin theorem, and more in this 1-2 hour study. Free textbook included.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Online Course

Undergrad Complexity at CMU - Why is P vs. NP Difficult?

Explore the complexity of P vs. NP problem in this 1-2 hour material by Ryan O'Donnell from Carnegie Mellon, covering negative results, Ladner's theorem, and simulations.

• YouTube
• 1 hour 20 minutes
• On-Demand
• Free Online Course

Undergrad Complexity at CMU - Hardness within P

Explore computational complexity theory with Ryan O'Donnell from Carnegie Mellon. Dive into topics like time hierarchy theorem, fine-grained complexity, and reduction algorithms in 1-2 hours.

• YouTube
• 1 hour 22 minutes
• On-Demand
• Free Online Course

Undergrad Complexity at CMU - Oracle Turing Machines and P^NP

Explore Computational Complexity Theory with Ryan O'Donnell from Carnegie Mellon. Dive into Oracle Turing Machines and P^NP in a 1-2 hour study.

• YouTube
• 1 hour 22 minutes
• On-Demand
• Free Online Course

Undergrad Complexity at CMU - BPP

Explore Computational Complexity Theory with Ryan O'Donnell at Carnegie Mellon. Expect 1-2 hours of material including lectures and readings.

• YouTube
• 1 hour 20 minutes
• On-Demand
• Free Online Course

Undergrad Complexity at CMU - Randomized Complexity- RP, coRP, and ZPP

Explore randomized complexity, RP, coRP, and ZPP in this 1-2 hour material from Carnegie Mellon, taught by Ryan O'Donnell. Dive into probabilistic Turing Machines and error amplification.

• YouTube
• 1 hour 22 minutes
• On-Demand
• Free Online Course

Undergrad Complexity at CMU - The Immerman-Szelepcsényi Theorem

Explore the Immerman--Szelepcsényi Theorem in Computational Complexity Theory with Ryan O'Donnell from Carnegie Mellon. Expect 1-2 hours of material.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Online Course

Learning About Quantum States - Majorization Theorems for the RSK Process

Explore combinatorial theorems about the RSK process in quantum states with Ryan O'Donnell. Less than an hour of engaging material.

• YouTube
• 22 minutes
• On-Demand
• Free Online Course