arXiv (All)
open access
Lower Bound of 22 for 3x3 Matrix Multiplication over the Integers
Strassen showed that two 2x2 matrices can be multiplied with 7 multiplications instead of 8. Applied recursively, his algorithm multiplies two nxn matrices with O(n^2.807) multiplications, beating the naive O(n^3). The best known 3x3 recursive matrix multiplication algorithm uses 23 multiplications
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- New lower bounds on tensor rank of $(2,n,m)$ matrix multiplication with GPT-6#1083833
- A lower bound for $\langle 3,2,m \rangle$ matrix multiplication#1036464
- Algorithmic Relative Complexity#427022
- How to grade the accuracy of the BLAS#1000265
- New lower bounds on tensor rank of $(n,2,m)$ matrix multiplication with GPT-6#1128639
Record · ID 1156910
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive