@InProceedings{grenet_et_al:LIPIcs.FSTTCS.2011.127,
author = {Grenet, Bruno and Koiran, Pascal and Portier, Natacha and Strozecki, Yann},
title = {{The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {127--139},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.127},
URN = {urn:nbn:de:0030-drops-33501},
doi = {10.4230/LIPIcs.FSTTCS.2011.127},
annote = {Keywords: Algebraic Complexity, Sparse Polynomials, Descartes' Rule of Signs, Lower Bound for the Permanent, Polynomial Identity Testing}
}