arXiv (All)
open access
Simple, Faster (min, +) Matrix Multiplication and APSP
In this note, we provide a deterministic algorithm that computes the $(\min, +)$-Matrix Product $C = A * B$ of two $N \times N$ matrices $A$ and $B$ with polynomially bounded integer entries in $\tilde{O}(N^{2.9964})$ time, improving upon the exponent of $O(N^{2.9995})$ time obtained in the recent b
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
- Rectangular Matrix Multiplication in the Low-Bandwidth Model#259430
- A Nuclear-Norm Lower Bound for Dithered Scalar Quantization of Matrix Products#972692
- Right Multiplication on Grammar-Compressed Matrices: A Streaming, Memory-Bounded GPU Engine#411015
- Truly Sub-$3^n$ Min-Sum Subset Convolution and Join Ordering#1234649
Record · ID 1355226
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