Theoretical Computer Science Courses
IEEE via YouTube A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip
IEEE via YouTube Correlated Pseudorandom Functions from Variable-Density LPN
IEEE via YouTube Low-Degree Hardness of Random Optimization Problems
IEEE via YouTube Near-Linear Size Hypergraph Cut Sparsifiers
IEEE via YouTube Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
IEEE via YouTube The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
IEEE via YouTube More Barriers for Rank Methods, via a "Numeric to Symbolic" Transfer
IEEE via YouTube Noise Sensitivity on the p-Biased Hypercube
IEEE via YouTube Breaking of 1RSB in Random MAX-NAE-SAT
IEEE via YouTube