Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
Group-theoretic Algorithms for Matrix Multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Colored intersection searching via sparse rectangular matrix multiplication
Proceedings of the twenty-second annual symposium on Computational geometry
Group-theoretic algorithms for matrix multiplication
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Analyzing group based matrix multiplication algorithms
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
KS ring theoretic approach for matrix multiplication
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Group-theoretic lower bounds for the complexity of matrix multiplication
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Multiplying matrices faster than coppersmith-winograd
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group algebra \mathbb{C}[G] and (2) controlling the dimensions of the irreducible representations of such groups. We present machinery and examples to support (1), including a proof that certain families of groups of order n^{2 + 0(1)} support n 脳 n matrix multiplication, a necessary condition for the approach to yield exponent 2. Although we cannot yet completely achieve both (1) and (2), we hope that it may be possible, and we suggest potential routes to that result using the constructions in this paper.