![Algorithms and Complexity in Algebraic Geometry_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Algorithms%20and%20Complexity%20in%20Algebraic%20Geometry_hi-res.jpg?h=450de763&itok=r3pqykMn)
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.