The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A Refined Laser Method and Faster Matrix Multiplication
Open accessAbstract
The complexity of matrix multiplication is measured in terms of ω, the smallest real number such that two n × n matrices can be multiplied using O(nω+∊) field operations for all ∊ > 0; the best bound until now is ω < 2.37287 [Le Gall'14]. All bounds on ω since 1986 have been obtained using the so-called laser method, a way to lower-bound the ‘value’ of a tensor in designing matrix multiplication algorithms. The main result of this paper is a refinement of the laser method that improves the resulting value bound for most sufficiently large tensors. Thus, even before computing any specific values, it is clear that we achieve an improved bound on ω, and we indeed obtain the best bound on ω to date: ω < 2.37286. The improvement is of the same magnitude as the improvement that [Le Gall'14] obtained over the previous bound [Vassilevska W.'12]. Our improvement to the laser method is quite general, and we believe it will have further applications in arithmetic complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Graph Implementations for Nonsmooth Convex Programs
Grant, M. C., & Boyd, S. P. (2007) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-1-84800-155-8_7 · Cited by 2,666
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Powers of tensors and fast matrix multiplication
Le Gall, F. (2014) · Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2608664 · Cited by 856
Multiplying matrices faster than coppersmith-winograd
Williams, V. V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214056 · Cited by 850
Self-citationOn Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Behrend, F. A. (1946) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.32.12.331 · Cited by 408
Partial and Total Matrix Multiplication
Schönhage, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210032 · Cited by 259
Rank and optimal computation of generic tensors
Strassen, V. (1983) · Linear Algebra and its Applications · doi:10.1016/0024-3795(83)80041-x · Cited by 222
Relative bilinear complexity and matrix multiplication.
Strassen, V. (1987) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1987.375-376.406 · Cited by 170
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor
Gall, F. L., & Urrutia, F. (2018) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975031.67 · Cited by 156
Improved bound for complexity of matrix multiplication
Davie, A. M., & Stothers, A. J. (2013) · Proceedings of the Royal Society of Edinburgh: Section A Mathematics · doi:10.1017/s0308210511001648 · Cited by 152
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Salem, R., & Spencer, D. C. (1942) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.28.12.561 · Cited by 134
On cap sets and the group-theoretic approach to matrix multiplication
Blasiak, J., Church, T., Cohn, H., Grochow, J. A., Naslund, E., Sawin, W. F., & Umans, C. (2017) · Discrete Analysis · doi:10.19086/da.1245 · Cited by 133
The asymptotic spectrum of tensors and the exponent of matrix multiplication
Strassen, V. (1986) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1986.52 · Cited by 120
A group-theoretic approach to fast matrix multiplication
Cohn, H., & Umans, C. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238217 · Cited by 105
A Group-theoretic Approach to Fast Matrix MultiplicationPreprint
Cohn, H., & Umans, C. (2003) · Cited by 105
On Sunflowers and Matrix Multiplication
Alon, N., Shpilka, A., & Umans, C. (2012) · Computational Complexity · doi:10.1007/s00037-013-0060-1 · Cited by 99
On the Complexity of Matrix Product
Raz, R. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702402147 · Cited by 84
New Fast Algorithms for Matrix Operations
Pan, V. Y. (1980) · SIAM Journal on Computing · doi:10.1137/0209027 · Cited by 84
Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
Romani, F. (1982) · SIAM Journal on Computing · doi:10.1137/0211020 · Cited by 69
The growth rate of tri-colored sum-free sets
Kleinberg, R., Sawin, W., & Speyer, D. E. (2018) · Discrete Analysis · doi:10.19086/da.3734 · Cited by 58
On the asymptotic complexity of matrix multiplication
Coppersmith, D., & Winograd, S. (1981) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1981.27 · Cited by 57
Barriers for Fast Matrix Multiplication from Irreversibility
Christandl, M., Vrana, P., & Zuiddam, J. (2021) · Theory of Computing · doi:10.4086/toc.2021.v017a002 · Cited by 46
Further Limitations of the Known Approaches for Matrix MultiplicationPreprint
Alman, J., & Williams, V. V. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2018.25 · Cited by 38
Self-citationLimits on All Known (and Some Unknown) Approaches to Matrix Multiplication
Alman, J., & Williams, V. V. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00061 · Cited by 37
Self-citationFast matrix multiplication using coherent configurations
Cohn, H., & Umans, C. (2013) · Cited by 33
New lower bounds for the border rank of matrix multiplicationPreprint
Landsberg, J. M., & Ottaviani, G. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1112.6007 · Cited by 31
Fast matrix multiplication using coherent configurations
Cohn, H., & Umans, C. (2013) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973105.77 · Cited by 31
Group-theoretic algorithms for matrix multiplication
Umans, C. (2006) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1145768.1145772 · Cited by 30
Bini, D. A. (2013) · Discrete mathematics and its applications · doi:10.1201/b16113-72 · Cited by 26
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd MethodPreprint
Ambainis, A., Filmus, Y., & Gall, F. L. (2015) · arXiv (Cornell University) · Cited by 25
Barriers for fast matrix multiplication from irreversibility
Christandl, M., Vrana, P., & Zuiddam, J. (2019) · Research at the University of Copenhagen (University of Copenhagen) · doi:10.4230/lipics.ccc.2019.26 · Cited by 25
Which groups are amenable to proving exponent two for matrix multiplication?Preprint
Blasiak, J., Church, T., Cohn, H., Grochow, J. A., & Umans, C. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.ccc.2025.9 · Cited by 17
Cited by
Discovering faster matrix multiplication algorithms with reinforcement learning
Fawzi, A., Balog, M., Huang, A., Hubert, T., Romera-Paredes, B., Barekatain, M., Novikov, A., R. Ruiz, F. J., Schrittwieser, J., Swirszcz, G., et al. (2022) · Nature · doi:10.1038/s41586-022-05172-4 · Cited by 478
Metadata
- Authors
- Alman, J., & Williams, V. V.
- Venue
- Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
- Published
- 2021-01
- Pages
- 522-539
- OpenAlex
- W3116253690
- Cited by
- 268
- References
- 33
- FWCI
- 80.69
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.