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=htVs8DwgCGg


Duration: 58:28
205 views
1

Chris Umans, California Institute of Technology
Tensors in Computer Science and Geometry
http://simons.berkeley.edu/talks/chris-umans-2014-11-12



Other Videos By Simons Institute for the Theory of Computing


2014-11-21Macaulay 2 Tutorial II
2014-11-21Schemes Associated with Eigenvectors of Tensors
2014-11-21Parliaments of Polytopes and Toric Vector Bundles
2014-11-21Tensors in Algebraic Statistics
2014-11-14Smoothed Analysis of Tensor Decompositions
2014-11-14Generalized Singular Values
2014-11-14Rank, Border Rank, Smoothable Rank and Cactus Rank
2014-11-14The Average Number of Critical Rank-One Approximations to a Tensor
2014-11-14NP-hardness of Nuclear Norms for Tensors
2014-11-14Geometry and Upper Bounds for the Complexity of Matrix Multiplication
2014-11-14Approaches to Bounding the Exponent of Matrix Multiplication
2014-11-14Tensors and Complexity in Quantum Information Science
2014-11-14Powers of Tensors and Fast Matrix Multiplication
2014-11-14Siegel's Theorem, Edge Coloring, and a Holant Dichotomy
2014-11-14Elementary Results on Maximal, Generic and Typical Ranks
2014-11-14Tensor Decompositions for Estimating Latent Variable Models
2014-11-14On Strassen's Conjecture
2014-11-14Matrix Multiplication: Coppersmith-Winograd and Beyond
2014-11-14Uniqueness of Tensor Decomposition and Identifiability in Mixture Models
2014-11-04An Efficient Parallel Solver for SDD Linear Systems
2014-11-04Graph Based Processing of Big Images


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithms and Complexity in Algebraic Geometry
Chris Umans