Geometry and Upper Bounds for the Complexity 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=nwDVham5254


Duration: 56:09
273 views
1

Joseph Landsberg, Texas A&M University
Tensors in Computer Science and Geometry
http://simons.berkeley.edu/talks/joseph-landsberg-2014-11-12



Other Videos By Simons Institute for the Theory of Computing


2014-11-21Computing Sheaf Cohomology for Products of Projective Spaces
2014-11-21Tensors, Secant Varieties and Interpolation
2014-11-21Geometry of Symmetric Bivariate Tensors of Fixed Typical Rank
2014-11-21Macaulay 2 Tutorial I
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-14Geometry and Upper Bounds for the Complexity of Matrix Multiplication
2014-11-14Learning Mixture of Gaussians using Moment Tensor
2014-11-14Orthogonal Tensor Decomposition
2014-11-14Towards a Complete Classification of Multipartite Entanglement
2014-11-14Cactus Varieties of Cubic Forms: Apolar Local Artinian Gorenstein Rings
2014-11-14Progress on Strassen's Conjecture
2014-11-14Approaches to Bounding the Exponent of Matrix Multiplication
2014-11-14Entanglement Polytopes
2014-11-14Characters of Equivariant D-modules on Veronese Cones
2014-11-14Tensor Decomposition, Sparse Representations and Applications
2014-11-14The Geometry of the Identifiability of Tensors


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