eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2009-12-14
25
36
10.4230/LIPIcs.FSTTCS.2009.2304
article
Arithmetic Circuits and the Hadamard Product of Polynomials
Arvind, Vikraman
Joglekar, Pushkar S.
Srinivasan, Srikanth
Motivated by the Hadamard product of matrices we define the Hadamard
product of multivariate polynomials and study its arithmetic circuit
and branching program complexity. We also give applications and
connections to polynomial identity testing. Our main results are
the following.
\begin{itemize}
\item[$\bullet$] We show that noncommutative polynomial identity testing for
algebraic branching programs over rationals is complete for
the logspace counting class $\ceql$, and over fields of characteristic
$p$ the problem is in $\ModpL/\Poly$.
\item[$\bullet$] We show an exponential lower bound for expressing the
Raz-Yehudayoff polynomial as the Hadamard product of two monotone
multilinear polynomials. In contrast the Permanent can be expressed
as the Hadamard product of two monotone multilinear formulas of
quadratic size.
\end{itemize}
https://drops.dagstuhl.de/storage/00lipics/lipics-vol004-fsttcs2009/LIPIcs.FSTTCS.2009.2304/LIPIcs.FSTTCS.2009.2304.pdf
Hadamard product
identity testing
lower bounds
algebraic branching programs