Multiplying matrices faster than coppersmith-winograd
@inproceedings{Williams2012MultiplyingMF, title={Multiplying matrices faster than coppersmith-winograd}, author={V. Williams}, booktitle={STOC '12}, year={2012} }
We develop an automated approach for designing matrix multiplication algorithms based on constructions similar to the Coppersmith-Winograd construction. Using this approach we obtain a new improved bound on the matrix multiplication exponent ω<2.3727.
843 Citations
An Adaptable Fast Matrix Multiplication Algorithm, Going Beyond the Myth of Decimal War
- Computer Science
- ArXiv
- 2013
- PDF
Counting points on curves using a map to P1, II
- Mathematics, Computer Science
- Finite Fields Their Appl.
- 2017
- 20
- Highly Influenced
- PDF
Simultaneous Conversions with the Residue Number System Using Linear Algebra
- Computer Science, Mathematics
- ACM Trans. Math. Softw.
- 2018
- 4
- PDF
Graph expansion and communication costs of fast matrix multiplication: regular submission
- Mathematics, Computer Science
- SPAA '11
- 2011
- 26
- PDF
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method
- Mathematics, Computer Science
- STOC
- 2015
- 35
- Highly Influenced
References
SHOWING 1-10 OF 15 REFERENCES
Matrix multiplication via arithmetic progressions
- Computer Science, Mathematics
- STOC '87
- 1987
- 1,246
- Highly Influential
- PDF
Group-theoretic algorithms for matrix multiplication
- Computer Science, Mathematics
- 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
- 2005
- 152
- Highly Influential
- PDF
On the Asymptotic Complexity of Matrix Multiplication
- Mathematics, Computer Science
- SIAM J. Comput.
- 1982
- 211
- Highly Influential
Partial and Total Matrix Multiplication
- Mathematics, Computer Science
- SIAM J. Comput.
- 1981
- 221
- Highly Influential
A group-theoretic approach to fast matrix multiplication
- Mathematics, Computer Science
- 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- 2003
- 124
- Highly Influential
- PDF
On Sunflowers and Matrix Multiplication
- Mathematics, Computer Science
- Computational Complexity Conference
- 2012
- 20
- Highly Influential
- PDF
Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
- Mathematics, Computer Science
- SIAM J. Comput.
- 1982
- 57
- Highly Influential
Algebraic complexity theory
- Computer Science
- Grundlehren der mathematischen Wissenschaften
- 1997
- 860
- Highly Influential