Theoretical Computer Science Courses
Institute for Pure & Applied Mathematics (IPAM) via YouTube On the Presentability of Artin Differentiable Stacks
IMSA via YouTube Recent Hardness of Approximation Results in Parameterized Complexity
Hausdorff Center for Mathematics via YouTube Parametrized Algorithms and Possible Future Directions
Hausdorff Center for Mathematics via YouTube The Approximation Ratio of the k-Opt Heuristic for Euclidean TSP
Hausdorff Center for Mathematics via YouTube First Order Concatenation Theory vs First Order Number Theory
Hausdorff Center for Mathematics via YouTube On Some Easy Problems That Are Hard for the Lasserre Hierarchy
Hausdorff Center for Mathematics via YouTube Collision-Resistance from Multi-Collision-Resistance
Simons Institute via YouTube Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography
Simons Institute via YouTube Quantum Minimalism
Simons Institute via YouTube