Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=lYK5UDBFIKs
Raghu Meka, UCLA
https://simons.berkeley.edu/talks/raghu-meka-11-8-17
Hierarchies, Extended Formulations and Matrix-Analytic Techniques
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Hierarchies Extended Formulations and Matrix-Analytic Techniques
Raghu Meka