Theoretical Computer Science Courses
IEEE via YouTube Is it Easier to Prove Statements that are Guaranteed to be True?
IEEE via YouTube Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
IEEE via YouTube Fully-Dynamic Submodular Cover with Bounded Recourse
IEEE via YouTube List Decodable Mean Estimation in Nearly Linear Time
IEEE via YouTube Nearly Optimal Pseudorandomness From Hardness
IEEE via YouTube Framework for Existential Real-Completeness of Two-Dimensional Packing Problems
IEEE via YouTube Smoothing the Gap Between NP and ER
IEEE via YouTube A Dichotomy for Real Boolean Holant Problems
IEEE via YouTube Tree-Depth and the Formula Complexity of Subgraph Isomorphism
IEEE via YouTube