arXiv (All)
open access
Simultaneous Matrix Multiplication by Tensor Contraction Aggregation
We present an interpretation of the fast matrix multiplication algorithms of Coppersmith and Winograd as aggregations of tensor contractions. This point of view provides a direct connection to older constructions by Pan and to more recent work on bilinear algorithms for symmetric tensor contraction.
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
- Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms#189122
- Asymptotic Rank Speedup Theorems, Revisited#1063927
- Piecewise Symmetric Tensors#1014760
- Triple Overlap in Pipelined Krylov Methods on Multi-GPU Systems#1390004
- Triple Overlap in Pipelined Krylov Methods on Multi-GPU Systems#1381204
Record · ID 1401725
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