Approaches to Bounding the Exponent of Matrix Multiplication

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


Duration: 53:56
514 views
2

Chris Umans, California Institute of Technology
Connections Between Algorithm Design and Complexity Theory
https://simons.berkeley.edu/talks/chris-umans-2015-09-30



Other Videos By Simons Institute for the Theory of Computing


2015-10-01On the Existence of Optimal Algorithms
2015-10-01Probabilistic Polynomials and Hamming Nearest Neighbors
2015-10-01Derandomization via Robust Algebraic Circuit Lower Bounds
2015-10-01Chasing Lower Bounds
2015-10-01Anti-Concentration for Polynomials of Independent Random Variables
2015-10-01Getting Harder All the Time?
2015-10-01QBF Satisfiability Algorithms and Connections with Circuit Lower Bounds
2015-10-01A Compression Algorithm for AC^0[p] Circuits Using Certifying Polynomials
2015-10-01Satisfiability Algorithms for Small Depth Circuits with Symmetric Gates
2015-10-01Sublinear Space Complexity
2015-10-01Approaches to Bounding the Exponent of Matrix Multiplication
2015-09-18Learning and Efficiency in Games
2015-09-09Proof of NEXP Not in ACC
2015-09-09Computational Complexity of Polynomial Time Problems: Introduction
2015-09-09Derandomization to Boolean Circuit Lower Bounds
2015-09-09Circuit Analysis Algorithms
2015-09-09Satisfiability Algorithms II
2015-09-09Hardness for Dynamic Problems; Conclusion and Future Research
2015-09-09The Easy Witness Lemma
2015-09-09Connections Between Hardness and Randomness in the Algebraic Setting
2015-09-09Hardness for Graph Problems - Reductions Based on APSP and SETH


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Fine-Grained Complexity and Algorithm Design
Chris Umans