Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
A Group-Theoretic Approach to Fast Matrix Multiplication
FOCS '03 Proceedings of the 44th 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
Necklaces, convolutions, and X + Y
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Finding a heaviest triangle is not harder than matrix multiplication
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
Decision problem for shuffled genes
Information and Computation
Adaptive Winograd's matrix multiplications
ACM Transactions on Mathematical Software (TOMS)
A note on compressed sensing and the complexity of matrix multiplication
Information Processing Letters
Analyzing group based matrix multiplication algorithms
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Matrix representation of solution concepts in multiple- decision-maker graph models
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special section: Best papers from the 2007 biometrics: Theory, applications, and systems (BTAS 07) conference
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Graph expansion and communication costs of fast matrix multiplication: regular submission
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Zigzag persistent homology in matrix multiplication time
Proceedings of the twenty-seventh annual symposium on Computational geometry
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
Computing stabilized norms for quantum operations via the theory of completely bounded maps
Quantum Information & Computation
Multi-modal constraint propagation for heterogeneous image clustering
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Multiplying matrices faster than coppersmith-winograd
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Communication-optimal parallel algorithm for strassen's matrix multiplication
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Graph expansion and communication costs of fast matrix multiplication
Journal of the ACM (JACM)
Fast monotone summation over disjoint sets
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Technical Note: A fast parallel Gauss Jordan algorithm for matrix inversion using CUDA
Computers and Structures
| Hi-index | 0.00 |
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.