Sparse MDS Matrices: Proof of the GM-MDS Conjecture

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


Duration: 1:05:33
579 views
5

Shachar Lovett (UC San Diego)
https://simons.berkeley.edu/talks/root-rank-barrier-log-rank-conjecture
Interactive Complexity



Other Videos By Simons Institute for the Theory of Computing


2018-10-29Detecting Weak Signals via Hypothesis Testing
2018-10-29Efficient Algorithms for Outlier-Robust Regression
2018-10-29Computational-Statistical Tradeoffs in Robust High-Dimensional Estimation
2018-10-29Robust List Decoding of Spherical Gaussians
2018-10-24Mathematical Theories of Communication: Old and New
2018-10-18Fully Understanding The Hashing Trick
2018-10-18Distributed Statistical Estimation of Matrix Products with Applications
2018-10-18The Sketching Complexity of Graph and Hypergraph Counting
2018-10-18Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation
2018-10-18On the Deterministic Complexity of Counting Events in a Stream
2018-10-18Sparse MDS Matrices: Proof of the GM-MDS Conjecture
2018-10-17Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication
2018-10-17Why Extension-Based Proofs Fail
2018-10-17Simulation beats Richness: New Data-Structure Lower Bounds
2018-10-17Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers
2018-10-17Static Data Structure Lower Bounds Imply Rigidity
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


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Interactive Complexity
Shachar Lovett