Lower bounds for non-commutative skew circuits

  title={Lower bounds for non-commutative skew circuits},
  author={Nutan Limaye and Guillaume Malod and Srikanth Srinivasan},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
Nisan (STOC 1991) exhibited a polynomial which is computable by linear sized noncommutative circuits but requires exponential sized non-commutative algebraic branching programs. Nisan’s hard polynomial is in fact computable by linear sized skew circuits (skew circuits are circuits where every multiplication gate has the property that all but one of its children is an input variable or a scalar). We prove that any non-commutative skew circuit which computes the square of the polynomial defined… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 13 extracted citations


Publications referenced by this paper.
Showing 1-10 of 22 references

Partial derivatives in arithmetic complexity and beyond

  • X. Chen, N. Kayal, A. Wigderson
  • Foundations and Trends in Theoretical Computer…
  • 2011

Arithmetic circuits: A survey of recent results and open questions

  • A. Shpilka, A. Yehudayoff
  • Foundations and Trends in Theoretical Computer…
  • 2010

Similar Papers

Loading similar papers…