arXiv (All)open access
Automated Lower Bounds for Bilinear Complexity over Finite Fields
computational complexity, data structures and algorithms, 68q17, 15a69, 68w30, 12y05, f.2.1; f.1.3
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 793591
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.