Lower Bounds for Elimination via Weak Regularity

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=In48e7VIlcY


Duration: 33:22
180 views
1

Michal Koucky (Charles University)
https://simons.berkeley.edu/talks/lower-bounds-elimination-weak-regularity
Interactive Complexity



Other Videos By Simons Institute for the Theory of Computing


2018-10-16Time-Space Tradeoffs for the Memory Game
2018-10-16Yes, There is an Oblivious RAM Lower Bound!
2018-10-16Distributed Interactive Proofs
2018-10-16On a Composition Theorem for Randomized Query Complexity
2018-10-16Strong Direct Sum for Randomized Query Complexity
2018-10-16Advances in Linear Sketching over Finite Fields
2018-10-15Network Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All
2018-10-15Bounded Independence Plus Noise, and the Communication Complexity of Decoding
2018-10-15Quantum Algorithms for Composed Functions With Shared Inputs
2018-10-15Round Elimination using Triangular Discrimination
2018-10-15Lower Bounds for Elimination via Weak Regularity
2018-10-15The Hardest Halfspace
2018-10-03The AI Trinity: Data + Algorithms + Infrastructure
2018-09-27Subspace Clustering using Ensembles of K-Subspaces
2018-09-27Spectrally Robust Graph Isomorphism
2018-09-27Fast Algorithms for Multivariate ODEs arising in Sampling and Learning
2018-09-27Matrix Martingales in Randomized Numerical Linear Algebra
2018-09-27A Fast Algorithm for Computing the Maximum Weight Base in a Linear Matroid
2018-09-27Matrix-free Construction of HSS Representations Using Adaptive Randomized Sampling
2018-09-26Smoothed Analysis of Low Rank Solutions to Semidefinite Programs via Burer Monteiro Factorization
2018-09-26Unbiased Estimates for Linear Regression via Volume Sampling


Tags:
Interactive Complexity
Michal Koucky
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley