New Breakthrough in Matrix Multiplication
Host
Rahul Ilango
MIT
Abstract:
Fast matrix multiplication is one of the most fundamental problems in computer science. We present new algorithms that improve the time complexity of matrix multiplication to n^2.371339, surpassing the previous bound of n^2.372860. Our result is the largest improvement to the matrix multiplication exponent since 2010. In this talk, we will introduce the modern framework for matrix multiplication algorithms and highlight the key ideas in our algorithms.
Fast matrix multiplication is one of the most fundamental problems in computer science. We present new algorithms that improve the time complexity of matrix multiplication to n^2.371339, surpassing the previous bound of n^2.372860. Our result is the largest improvement to the matrix multiplication exponent since 2010. In this talk, we will introduce the modern framework for matrix multiplication algorithms and highlight the key ideas in our algorithms.