arXiv (All)open access
A lower bound for $\langle 3,2,m \rangle$ matrix multiplication
computational complexity, data structures and algorithms, 68q17, 15a69
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1036464
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.