Theoretical Computer Science Courses
Simons Institute via YouTube Top-Down Lower Bounds for Depth-Four Circuits
Simons Institute via YouTube Nearly All K-SAT Functions Are Unate
Simons Institute via YouTube Revisiting Trade-Offs and Impossibility Theorems
Association for Computing Machinery (ACM) via YouTube Tight Space Complexity of the Coin Problem
Simons Institute via YouTube Some Remarks About Quantum and Classical Local Hamiltonian Optimization and SDP Rounding
Simons Institute via YouTube Structure of Communication - Richard M. Karp Distinguished Lecture
Simons Institute via YouTube Randomized versus Deterministic Decision Tree Size
Simons Institute via YouTube Structure of Boolean Almost Low Degree Functions on the Biased Cube
Simons Institute via YouTube Structures in Random Graphs - New Connections
Simons Institute via YouTube