Partition ranks bound multiplicative complexity from below for constant-degree multilinear arithmetic circuits, generalizing Strassen's tensor-rank characterization.
Small subalgebras of polynomial rings and Stillman’s conjecture.J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A linear upper bound on the projective dimension of height 3 quadratic ideals.
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.
-
A Linear Bound on the Projective Dimension of Height 3 Quadratic Ideals
A linear upper bound on the projective dimension of height 3 quadratic ideals.