arXiv (All)
open access
Automated Lower Bounds for Bilinear Complexity over Finite Fields
We present a general, automated framework for proving lower bounds on the bilinear complexity (tensor rank) of multiplication problems over a finite field $\mathbb{F}_q$. The framework is parameterized only by the multiplication tensor and by a group of rank-preserving symmetries acting on one argum
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
- Automated Lower Bounds for Bilinear Complexity over Finite Fields#789587
- DanLing NestedTensor: Composable Multi-Ragged Tensors for Deep Learning#1104578
- Fast and Accurate CP-HIFI Tensor Decompositions: Exploiting Kronecker Structure#629952
- Fast and Accurate CP-HIFI Tensor Decompositions: Exploiting Kronecker Structure#628090
- Exact Maximum Likelihood Decoding beyond Treewidth via Rank-Decomposition Dynamic Programming#1144523
Record · ID 793591
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