Theoretical Computer Science Courses
Simons Institute via YouTube Finding Large Cliques in Random and Semi-Random Graphs
Simons Institute via YouTube An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture
Simons Institute via YouTube Are We Aging Well?
Simons Institute via YouTube Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits
Simons Institute via YouTube Berkeley in the 80s - Andrew Yao's Turing Award-Winning Research
Simons Institute via YouTube Crash Course on Probabilistically Checkable Proofs - PCP
Simons Institute via YouTube Sensitivity Conjecture and Its Applications
Simons Institute via YouTube Advances in Boolean Function Analysis - On the Fourier-Entropy Influence Conjecture
Simons Institute via YouTube Berkeley in the 80s - Manuel Blum's Contributions to Computing Theory
Simons Institute via YouTube