Group-theoretic algorithms for matrix multiplication

DOI10.1109/SFCS.2005.39MaRDI QIDQ6476323zbMATH OpenWikidataFDO

Authors Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans

Publication date 17 November 2005

Full work available at URL https://doi.org/10.1109/SFCS.2005.39

Abstract: 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 which achieves exponent 2.41. We present two conjectures regarding specific improvements, one combinatorial and the other algebraic. Either one would imply that the exponent of matrix multiplication is 2.

This page was built for publication: Group-theoretic algorithms for matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6476323)