Group-theoretic Algorithms for Matrix Multiplication

We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically faster than the standard algorithm. We describe several families of wreath product groups that achieve matrix multiplication exponent less than 3, the asymptotically fastest of

• Type: Conference
• Year: 2005
• Where: FOCS
• Authors: Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans
• Keywords: FOCS 2005, Group-theoretic Approach, Matrix Multiplication, Matrix Multiplication Exponent, Theoretical Computer Science