Arithmetic Circuits and the Hadamard Product of Polynomials

DOI10.4230/LIPIcs.FSTTCS.2009.2304zbMath1248.68209OpenAlexW2964195296MaRDI QIDQ2920110

Srikanth Srinivasan, V. Arvind, Pushkar S. Joglekar

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_0789.html

zbMATH Keywords

Hadamard productlower boundsalgebraic branching programsidentity testing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Fast exact algorithms using Hadamard product of polynomials ⋮ On the hardness of the noncommutative determinant ⋮ Unnamed Item ⋮ On Hard Instances of Non-Commutative Permanent ⋮ On hard instances of non-commutative permanent ⋮ Geometric complexity theory V: Efficient algorithms for Noether normalization ⋮ Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees

This page was built for publication: Arithmetic Circuits and the Hadamard Product of Polynomials