{
"@context": "http://schema.org",
"@type": "ScholarlyArticle",
"@id": "https://doi.org/10.4230/lipics.fsttcs.2009.2304",
"url": "http://drops.dagstuhl.de/opus/volltexte/2009/2304/",
"additionalType": "ConferencePaper",
"name": "Arithmetic Circuits and the Hadamard Product of Polynomials",
"author": [
{
"@type": "Person",
"name": "Vikraman Arvind",
"givenName": "Vikraman",
"familyName": "Arvind"
},
{
"@type": "Person",
"name": "Pushkar S. Joglekar",
"givenName": "Pushkar S.",
"familyName": "Joglekar"
},
{
"@type": "Person",
"name": "Srikanth Srinivasan",
"givenName": "Srikanth",
"familyName": "Srinivasan"
}
],
"description": "Motivated by the Hadamard product of matrices we define the Hadamard\n product of multivariate polynomials and study its arithmetic circuit\n and branching program complexity. We also give applications and\n connections to polynomial identity testing. Our main results are\nthe following.\n\\begin{itemize}\n\\item[$\\bullet$] We show that noncommutative polynomial identity testing for\n algebraic branching programs over rationals is complete for\nthe logspace counting class $\\ceql$, and over fields of characteristic\n$p$ the problem is in $\\ModpL/\\Poly$.\n\\item[$\\bullet$] We show an exponential lower bound for expressing the\n Raz-Yehudayoff polynomial as the Hadamard product of two monotone\n multilinear polynomials. In contrast the Permanent can be expressed\n as the Hadamard product of two monotone multilinear formulas of\n quadratic size.\n\\end{itemize}",
"version": "1.0",
"keywords": "Computer Science, {\"subject_scheme\"=>\"DDC\", \"text\"=>\"000 Computer science, knowledge, general works\"}",
"inLanguage": "eng",
"datePublished": "2009",
"schemaVersion": "http://datacite.org/schema/kernel-2.1",
"publisher": {
"@type": "Organization",
"name": "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany"
},
"provider": {
"@type": "Organization",
"name": "DataCite"
}
}