Proves an Omega(nd) size lower bound for fan-in-2 noncommutative circuits computing the palindrome polynomial, giving Omega(n squared) when d equals n.
The complexity of partial derivatives.Theoretical Computer Science, 22(3):317–330
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
-
A Quadratic Lower Bound for Noncommutative Circuits
Proves an Omega(nd) size lower bound for fan-in-2 noncommutative circuits computing the palindrome polynomial, giving Omega(n squared) when d equals n.