The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent

Bruno Grenet 1, 2 Pascal Koiran 1, 2 Natacha Portier 1, 2 Yann Strozecki 2, 3
1 LIP - Laboratoire de l'Informatique du Parallélisme
2 Department of Computer Science [Toronto]
3 ELM - Équipe de Logique Mathématique
Abstract : Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has recently proposed a "real tau-conjecture" which is inspired by this connection. The real tau-conjecture states that the number of real roots of a sum of products of sparse univariate polynomials should be polynomially bounded. It implies a superpolynomial lower bound on the size of arithmetic circuits computing the permanent polynomial. In this paper we show that the real tau-conjecture holds true for a restricted class of sums of products of sparse polynomials. This result yields lower bounds for a restricted class of depth-4 circuits: we show that polynomial size circuits from this class cannot compute the permanent, and we also give a deterministic polynomial identity testing algorithm for the same class of circuits.
Keywords : Algebraic Complexity Sparse Polynomials Descartes' Rule of Signs Lower Bound for the Permanent Polynomial Identity Testing
Type de document :
Communication dans un congrès
Supratik Chakraborty and Amir Kumar. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), Dec 2011, Mumbai, India. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 13, pp.16, 2011, Leibniz International Proceedings in Informatics. 〈10.4230/LIPIcs.FSTTCS.2011.127〉
Liste complète des métadonnées
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00607154
Contributeur : Bruno Grenet <>
Soumis le : vendredi 8 juillet 2011 - 02:53:55
Dernière modification le : mardi 24 avril 2018 - 13:52:58

Lien texte intégral

arxiv

Identifiants

Collections

ENS-LYON | INRIA | ELM | LIP | USPC | UNIV-LYON1

Citation

Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki. The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. Supratik Chakraborty and Amir Kumar. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), Dec 2011, Mumbai, India. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 13, pp.16, 2011, Leibniz International Proceedings in Informatics. 〈10.4230/LIPIcs.FSTTCS.2011.127〉. 〈ensl-00607154〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

102

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD