arXiv (All)
open access
Matrix Multiplication from Polynomial Packings: A Constructive and Elementary Proof of $ω\le9/4$
We give a self-contained constructive proof that the matrix multiplication exponent satisfies $ω\le9/4$. This bound was recently claimed by OpenAI~\cite{original} through non-constructive arguments in Strassen's asymptotic spectral framework, counting exact scalar arithmetic operations over the comp
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
- A faster matrix multiplication algorithm through structured optimization#1247520
- Right Multiplication on Grammar-Compressed Matrices: A Streaming, Memory-Bounded GPU Engine#411015
- Orthogonal and unitary signings of cube-like graphs#1118892
- Simple, Faster (min, +) Matrix Multiplication and APSP#1355226
- Precise Delocalisation and Gumbel Laws for Eigenvectors of Wigner Matrices#999332
Record · ID 1412682
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