arXiv (All)
open access
A faster matrix multiplication algorithm through structured optimization
We present a new asymptotic matrix multiplication construction yielding $ω<2.37115924$, and therefore an algorithm that multiplies two $n\times n$ matrices in $O(n^{2.37115924})$ arithmetic operations over the rationals, reals, or complex numbers. The construction improves the bound $2.371177$ of Du
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
- Rectangular Matrix Multiplication in the Low-Bandwidth Model#259430
- Right Multiplication on Grammar-Compressed Matrices: A Streaming, Memory-Bounded GPU Engine#411015
- Simple, Faster (min, +) Matrix Multiplication and APSP#1355226
- On the Real Part of Butterfly Factorizations, with Application to Fast Transforms#1215681
- A single-precision floating-point systolic Givens-QRD Triangular Solver for MVDR Beamforming#925500
Record · ID 1247520
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