Talks
Fall 2014

Geometry and Upper Bounds for the Complexity of Matrix Multiplication

Wednesday, November 12th, 2014 9:00 am9:50 am

Add to Calendar

The best lower bounds for the complexity (more precisely rank and border rank) of matrix multiplication come from geometry. I will describe work in progress for new ways to use geometry to derive explicit algorithms and to prove upper bounds for the complexity of matrix multiplication.