YoVDO

Theoretical Computer Science Courses

Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems
Ryan O'Donnell via YouTube
Analysis of Boolean Functions - Restrictions and the Goldreich-Levin Theorem
Ryan O'Donnell via YouTube
Graph Theory and Fixed-Parameter Tractability
Association for Computing Machinery (ACM) via YouTube
Approximation Algorithms
Association for Computing Machinery (ACM) via YouTube
Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture
Association for Computing Machinery (ACM) via YouTube
The Impossibility of Efficient Quantum Weak Coin Flipping
Association for Computing Machinery (ACM) via YouTube
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
Association for Computing Machinery (ACM) via YouTube
Catalytic Approaches to the Tree Evaluation Problem
Association for Computing Machinery (ACM) via YouTube
Strong Self-Concordance and Sampling
Association for Computing Machinery (ACM) via YouTube
Automating Cutting Planes is NP-Hard
Association for Computing Machinery (ACM) via YouTube
< Prev Page 9 Next >