YoVDO

Theoretical Computer Science Courses

Why Are Proof Complexity Lower Bounds Hard?
IEEE via YouTube
Agreement Testing Theorems on Layered Set Systems
IEEE via YouTube
Derandomization from Algebraic Hardness - Treading the Borders
IEEE via YouTube
Efficient Construction of Rigid Matrices Using an NP Oracle
IEEE via YouTube
Hardness of Coding Problems
IEEE via YouTube
Hardness Magnification for All Sparse NP Languages
IEEE via YouTube
Near Optimal Massively Parallel Graph Connectivity
IEEE via YouTube
Polynomial Calculus Space and Resolution Width
IEEE via YouTube
A Tight Analysis of Bethe Approximation for Permanent
IEEE via YouTube
Inapproximability of Clustering in Lp Metrics
IEEE via YouTube
< Prev Page 14 Next >