Partition ranks bound multiplicative complexity from below for constant-degree multilinear arithmetic circuits, generalizing Strassen's tensor-rank characterization.
On the orbit closure containment problem and slice rank of tensors
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Partition Rank and Algebraic Circuit Lower Bounds
Partition ranks bound multiplicative complexity from below for constant-degree multilinear arithmetic circuits, generalizing Strassen's tensor-rank characterization.