Arithmetic circuits and the Hadamard product of polynomials

DOI10.4230/LIPICS.FSTTCS.2009.2304zbMATH Open1248.68209OpenAlexW2964195296MaRDI QIDQ2920110FDOQ2920110

Authors: Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan 

Publication date: 24 October 2012

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

Recommendations

• Deterministic polynomial identity testing in non-commutative models
• On the hardness of the noncommutative determinant
• Arithmetic circuits: a chasm at depth 3
• Fast exact algorithms using Hadamard product of polynomials
• Fast Exact Algorithms Using Hadamard Product of Polynomials

zbMATH Keywords

lower boundsalgebraic branching programsHadamard productidentity 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)

Cited In (9)

• Title not available (Why is that?)
• On the hardness of the noncommutative determinant
• Fast exact algorithms using Hadamard product of polynomials
• Arithmetic and Algebraic Circuits
• On hard instances of non-commutative permanent
• Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
• Fast Exact Algorithms Using Hadamard Product of Polynomials
• Geometric complexity theory. V: Efficient algorithms for Noether normalization
• On hard instances of non-commutative permanent

This page was built for publication: Arithmetic circuits and the Hadamard product of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920110)