Abstract

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.

Video Recording