Undergraduate Complexity Theory
Rigorous introduction to computability and complexity theory, covering Turing machines, diagonalization, NP-completeness, space complexity, Savitch's theorem, and the polynomial hierarchy.
Professor of Computer Science
Complete university lecture series taught by Ryan O'Donnell.
Rigorous introduction to computability and complexity theory, covering Turing machines, diagonalization, NP-completeness, space complexity, Savitch's theorem, and the polynomial hierarchy.
Intensive PhD-level complexity theory sequence examining circuit complexity, randomized computation, interactive proofs, PCP theorem foundations, pseudorandomness, and hardness amplification.
Research-level course developing Fourier analysis over the Boolean hypercube, hypercontractivity, noise stability, invariance principles, and applications to hardness of approximation and social choice.
Mathematical development of quantum circuits, entanglement, quantum query complexity, phase estimation, Shor's factoring algorithm, quantum channels, and quantum error correction.
Essential mathematical machinery for theoretical computer science research: asymptotic tail bounds, spectral graph theory, expanders, linear and semidefinite programming duality, and Fourier analysis.
Self-contained public lectures, keynote addresses, and research seminars.
An foundational lecture introducing the Exponential Time Hypothesis (ETH), a crucial conjecture in theoretical computer science that posits limits on efficient solvability for NP-hard problems.
This lecture, part of a graduate computational complexity course, delves into the intricate details required to complete the proof of the Exponential Time Hypothesis (ETH).
Concluding the detailed exposition of the efficient quantum factoring algorithm, this lecture focuses on the final intricacies of rotation estimation in superposition.
Recapping the foundational role of the Hadamard Transform in quantum algorithms, this lecture provides a rigorous examination of its implications for quantum computation.
An initial exploration into the dynamics of Rotation Estimation when applied to quantum superposition states, a critical component of advanced quantum algorithms.
A focused review of quantum algorithms, specifically delving into Grover's Algorithm for the Boolean satisfiability problem, as part of a comprehensive quantum computing series.



Harmonic analysis on the hypercube, linearity testing, social choice, and quantum circuits
Carnegie Mellon University
Search or browse every recorded session across courses and talks.