The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Multiplying matrices faster than coppersmith-winograd
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
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
Bürgisser, P., Clausen, M., & Shokrollahi, M. A. (1997) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-03338-8 · Cited by 1,026
Intersection Theorems for Systems of Sets
Erdös, P., & Rado, R. (1960) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-35.1.85 · Cited by 626
On 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
General context-free recognition in less than cubic time
Valiant, L. G. (1975) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(75)80046-8 · Cited by 371
Partial and Total Matrix Multiplication
Schönhage, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210032 · Cited by 259
O(n2.7799) complexity for n × n approximate matrix multiplication
Bini, D., Capovani, M., Romani, F., & Lotti, G. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90113-3 · Cited by 207
Group-theoretic Algorithms for Matrix Multiplication
Cohn, H., Kleinberg, R., Szegedy, B., & Umans, C. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.39 · Cited by 201
Cited by
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Exact controllability of complex networks
Yuan, Z., Zhao, C., Di, Z., Wang, W.-X., & Lai, Y.-C. (2013) · Nature Communications · doi:10.1038/ncomms3447 · Cited by 565
Measuring user influence on Twitter: A survey
Riquelme, F., & González-Cantergiani, P. (2016) · Information Processing & Management · doi:10.1016/j.ipm.2016.04.003 · Cited by 429
Multiple-Robot Simultaneous Localization and Mapping: A Review
Saeedi, S., Trentini, M., Seto, M., & Li, H. (2016) · Journal of Field Robotics · doi:10.1002/rob.21620 · Cited by 324
Metadata
- Authors
- Williams, V. V.
- Venue
- Proceedings of the forty-fourth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2012-05-19
- Pages
- 887-898
- OpenAlex
- W2038073775
- Cited by
- 850
- References
- 18
- FWCI
- 94.41
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multiplying matrices faster than coppersmith-winograd. https://app.cochat.ai/papers/10.1145/2213977.2214056
- The paper
- Williams, V. V. (2012). Multiplying matrices faster than coppersmith-winograd. Proceedings of the forty-fourth annual ACM symposium on Theory of computing. https://doi.org/10.1145/2213977.2214056
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.
