Theoretical Computer Science Courses
Institute for Advanced Study via YouTube Proof and Circuit Complexity - Robert Robere
Institute for Advanced Study via YouTube Univalence from a Computer Science Point-of-View - Dan Licata
Institute for Advanced Study via YouTube Dinur's PCP- Degree-Reduction, Expanderizing, Mini-PCP - Lecture 27c of CS Theory Toolkit
Ryan O'Donnell via YouTube Deterministic Communication Complexity - Lecture 23b of CS Theory Toolkit
Ryan O'Donnell via YouTube Trees and Series-Parallel Graphs - Lecture 22a of CS Theory Toolkit
Ryan O'Donnell via YouTube Constraint Satisfaction Problems - Lecture 20b of CS Theory Toolkit
Ryan O'Donnell via YouTube Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit
Ryan O'Donnell via YouTube The SDP Relaxation for Max-Cut - Lecture 19b of CS Theory Toolkit
Ryan O'Donnell via YouTube The Ellipsoid Algorithm - Lecture 19a of CS Theory Toolkit
Ryan O'Donnell via YouTube