Non-commutative arithmetic circuits computing an explicit degree-n polynomial in n variables require Ω(n^{1.5}) product gates, improving on prior slightly super-linear bounds.
Numerische Mathematik, 20(3): 238–251
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
-
Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings
Non-commutative arithmetic circuits computing an explicit degree-n polynomial in n variables require Ω(n^{1.5}) product gates, improving on prior slightly super-linear bounds.