The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
Abstract
This paper develops an algorithm to multiply a $p \times 2$ matrix by a $2 \times n$ matrix in $\lceil (3pn + \max (n,p)) 2\rceil $ multiplications without use of commutativity of matrix elements. The algorithm minimizes the number of multiplications for matrix multiplication without commutativity for the special cases $p = 1$ or $2,n = 1,2, \cdots $ and $p = 3,n = 3$. It is shown that commutativity actually reduces the number of multiplications required.
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
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Research works printed but not linked: 3
- 10.1070/rm1966v021n01ABEH004147 · doi:10.1070/rm1966v021n01abeh004147
- 10.1073/pnas.58.5.1840 · doi:10.1073/pnas.58.5.1840
- 10.1109/TC.1968.227420 · DOI
Cited by
Håstad, J. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90014-6 · Cited by 584
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
Partial and Total Matrix Multiplication
Schönhage, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210032 · Cited by 259
AlphaEvolve: A coding agent for scientific and algorithmic discovery
Novikov, A., Vũ, N., Eisenberger, M., Dupont, E., Huang, P.-S., Wagner, A. Z., Shirobokov, S., Kozlovskii, B., Ruiz, F. J. R., Mehrabian, A., et al. (2025) · arXiv · doi:10.48550/arxiv.2506.13131 · Cited by 15
Metadata
- Authors
- Hopcroft, J. E., & Kerr, L. R.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1971-01
- Volume
- 20
- Issue
- 1
- Pages
- 30-36
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W1986272312
- Cited by
- 169
- References
- 1
- FWCI
- 5.65
- Type
- journal article
- 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: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication. https://app.cochat.ai/papers/10.1137/0120004
- The paper
- Hopcroft, J. E., & Kerr, L. R. (1971). On Minimizing the Number of Multiplications Necessary for Matrix Multiplication. SIAM Journal on Applied Mathematics. https://doi.org/10.1137/0120004
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.