arXiv (All)open access
A Structural Proof of the Lower Bound 21 for $3\times3$ Matrix Multiplication over $\mathbb F_2$
computational complexity, data structures and algorithms, symbolic computation, 68q17, 15a69, 05b25, 68v20
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1012889
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.