Computational Complexity Theory Courses
IEEE via YouTube A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions
IEEE via YouTube Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization
IEEE via YouTube On One-way Functions and Kolmogorov Complexity
IEEE via YouTube On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
IEEE via YouTube NEXP is Contained in MIP* - Complexity Theory Breakthrough
IEEE via YouTube Alan Turing and the Other Theory of Computing and Can a Machine Be Conscious?
Alan Turing Institute via YouTube Introduction to Commuting Local Hamiltonian Problems
Simons Institute via YouTube Zero Knowledge and Advanced Cryptography - Sessions from PKC 2024
TheIACR via YouTube An Introduction to Algorithmics
Pluralsight