arXiv (All)
open access
Fast and Stable Arbitrary Precision Approximate Matrix Multiplication
We present several new and surprising results on the theory and practice of Arbitrary Precision Approximate (APA) matrix multiplication, which refers to algorithms that output merely approximations to matrix multiplication even in exact arithmetic. While APA algorithms have been around for nearly ha
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
- High-Rate Quantized Matrix Multiplication II#180656
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#625429
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#623156
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#459639
- Accurate and Scalable Matrix Mechanisms via Divide and Conquer#2782
Record · ID 1298401
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