@BOOK{Burg, AUTHOR = {B\"urgisser, P.}, PUBLISHER = {Springer}, TITLE = {Completeness and Reduction in Algebraic Complexity Theory}, YEAR = {2000}, SERIES = {Algorithms and Computation in Mathematics}, NUMBER = {7} } @INPROCEEDINGS{Valiant82, AUTHOR = {Valiant, L. G.}, BOOKTITLE = {Logic and Algorithmic (an International Symposium held in honour of {Ernst Specker})}, PAGES = {365-380}, PUBLISHER = {Monographie $n^{\tiny o}$ 30 de L'Enseignement Math\'ematique}, TITLE = {Reducibility by algebraic projections}, YEAR = {1982} } @Book{PoSz76, author = {P\'olya, G. and Szeg\H{o}, G.}, title = {Problems and Theorems in Analysis. Volume II}, publisher = {Springer}, year = {1976} } @Book{Hur90, author = {Hurewicz, W.}, title = {Lectures on ordinary differential equations}, publisher = {Dover edition}, pages = {xvii, 122}, year = {1990} } @InProceedings{GKPS11, author = {Grenet, B. and Koiran, P. and Portier, N. and Strozecki, Y.}, 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)}, year = {2011}, volume = {13} } @InProceedings{Koi10, author = {Koiran, P.}, title = {Shallow circuits with high-powered inputs}, booktitle = {Proceedings of the Second Symposium on Innovations in Computer Science,}, year = {2011}, pages = {309-320}, ee = {http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/5.html}, bibsource = {DBLP, http://dblp.uni-trier.de} } @Article{BoDu10, author = {Bostan, A. and Dumas, P.}, title = {Wronskians and linear independance}, journal = {American Mathematical Monthly}, volume = {117}, number = {8}, pages = {722-727}, year = {2010} } @article {KaIm04, author = {Kabanets, V. and Impagliazzo, R.}, affiliation = {Simon Fraser University School of Computing Science Vancouver BC V5A 1S6 Canada Vancouver BC V5A 1S6 Canada}, title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds}, journal = {Computational Complexity}, publisher = {Birkhäuser Basel}, issn = {1016-3328}, keyword = {Computer Science}, pages = {1-46}, volume = {13}, issue = {1}, url = {http://dx.doi.org/10.1007/s00037-004-0182-6}, note = {10.1007/s00037-004-0182-6}, year = {2004} } @inproceedings{HeSc80, author = {Heintz, J. and Schnorr, C.P.}, title = {Testing polynomials which are easy to compute (Extended Abstract)}, booktitle = {Proceedings of the twelfth annual ACM symposium on Theory of computing}, series = {STOC '80}, year = {1980}, isbn = {0-89791-017-6}, location = {Los Angeles, California, United States}, pages = {262--272}, numpages = {11}, url = {http://doi.acm.org/10.1145/800141.804674}, doi = {10.1145/800141.804674}, acmid = {804674}, publisher = {ACM}, address = {New York, NY, USA}, } @incollection {Agr05, author = {Agrawal, M.}, affiliation = {Department of Computer Science, Indian Institute of Technology, Kanpur}, title = {Proving Lower Bounds Via Pseudo-random Generators}, booktitle = {FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science}, series = {Lecture Notes in Computer Science}, editor = {Sarukkai, Sundar and Sen, Sandeep}, publisher = {Springer Berlin / Heidelberg}, isbn = {978-3-540-30495-1}, keyword = {Computer Science}, pages = {92-105}, volume = {3821}, url = {http://dx.doi.org/10.1007/11590156_6}, note = {10.1007/11590156_6}, year = {2005}, } @article {ShSm95, author = {Shub, M. and Smale, S.}, title = {{On the intractability of Hilbert's Nullstellensatz and an algebraic version of {P}={NP}}}, journal = {Duke Mathematical Journal}, volume = {81}, number = {1}, pages = {47-54}, year = {1995}, } @article {Sm98, author = {Smale, S.}, title = {Mathematical problems for the next century}, journal = {Mathematical Intelligencer}, volume = {20}, number = {2}, pages = {7-15}, year = {1998}, } @book{kh91, title={Fewnomials}, author={Khovanski\u{\i}, A.G.}, isbn={9780821845479}, lccn={sf87037012}, issn={0065-9282}, series={Translations of Mathematical Monographs}, url={http://books.google.fr/books?id=VYdQ-VZtQLgC}, year={1991}, publisher={American Mathematical Society} } @article{Ave09, title = {The number of roots of a lacunary bivariate polynomial on a line}, journal = {Journal of Symbolic Computation}, volume = {44}, number = {9}, pages = {1280 - 1284}, year = {2009}, issn = {0747-7171}, doi = {10.1016/j.jsc.2008.02.016}, author = {Avenda\~no, M.} } @article{Pea1889a, title = {Sur le d\'eterminant Wronskien}, journal = {Mathesis}, volume = {9}, pages = {75-76}, year = {1889}, author = {Peano, G.} } @article{Pea1889b, title = {Sur les Wronskiens}, journal = {Mathesis}, volume = {9}, pages = {110-112}, year = {1889}, author = {Peano, G.} } @article{Bo1900b, title = {The Theory of Linear Dependence}, author = {B\^ocher, M.}, journal = {The Annals of Mathematics}, volume = {2}, number = {1/4}, series = {Second Series}, jstor_formatteddate = {1900 - 1901}, pages = {81-96}, ISSN = {0003486X}, year = {1900}, publisher = {Annals of Mathematics}, } @article{Bo1900a, title = {On linear dependence of functions of one variable}, author = {B\^ocher, M.}, journal = {Bull. Amer. Math. Soc.}, volume = {7}, pages = {120-121}, year = {1900}, } @book{Har64, title = {Ordinary Differential Equations}, author = {Hartman, P.}, year = {1964}, publisher = {John Wiley & Sons, Inc.} } @misc{HistWr, title = {Peano on Wronskians: A Translation}, author = {Engdahl, S.M. and Parker, A.E.}, note = {\url{http://mathdl.maa.org/mathDL/46/?pa=content&sa=viewDocument&nodeId=3642&pf=1}} } @book{Mui33, title = {A Treatise on the Theory of Determinants}, author = {Muir, T.}, publisher = {Dover Phoenix Editions}, year = {1933} } @article {Voo76, author = {Voorhoeve, M.}, affiliation = {Mathematisch Instituut Postbox 2160 Leiden The Netherlands}, title = {On the oscillation of exponential polynomials}, journal = {Mathematische Zeitschrift}, publisher = {Springer Berlin / Heidelberg}, issn = {0025-5874}, keyword = {Mathematics and Statistics}, pages = {277-294}, volume = {151}, issue = {3}, url = {http://dx.doi.org/10.1007/BF01214940}, year = {1976} } @article{VP75, title = {Wronskian determinants and the zeros of certain functions}, journal = {Indagationes Mathematicae (Proceedings)}, volume = {78}, number = {5}, pages = {417 - 424}, year = {1975}, issn = {1385-7258}, doi = {10.1016/1385-7258(75)90050-5}, url = {http://www.sciencedirect.com/science/article/pii/1385725875900505}, author = {Voorhoeve, M. and Van Der Poorten, A.J.} } @article {LRW03, author = {Li, T.Y. and Rojas, J.M. and Wang, X.}, affiliation = {Department of Mathematics, Michigan State University,East Lansing, MI 48824 USA}, title = {{Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces}}, journal = {Discrete \& Computational Geometry}, publisher = {{Springer New York}}, issn = {0179-5376}, keyword = {Mathematics and Statistics}, pages = {379-414}, volume = {30}, issue = {3}, url = {http://dx.doi.org/10.1007/s00454-003-2834-8}, year = {2003} } @article{Fro76, author = {Frobenius, G.F.}, title = {{\"Ueber die Determinante mehrerer Functionen einer Variabeln}}, journal = {{Journal f\"ur die reine und angewandte Mathematik (Crelle's Journal)}}, pages = {245-257}, volume = {1874}, issue = {77}, year = {1874} } @article{KPT12, author = {Koiran, P. and Portier, N. and Tavenas, S.}, title = {{A Wronskian approach to the real $\tau$-conjecture}}, journal = {arXiv:1205.1015v1}, year = {2012} } @book{GG03, title={Modern computer algebra}, author={Von Zur Gathen, J. and Gerhard, J.}, year={2003}, publisher={Cambridge University Press} } @inproceedings{HS80, author = {Heintz, J. and Schnorr, C.P.}, title = {Testing Polynomials which Are Easy to Compute (Extended Abstract)}, booktitle = {STOC}, year = {1980}, pages = {262-272}, ee = {http://doi.acm.org/10.1145/800141.804674}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{KI04, author = {Kabanets, V. and Impagliazzo, R.}, title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds}, journal = {Computational Complexity}, volume = {13}, number = {1-2}, year = {2004}, pages = {1-46}, ee = {http://dx.doi.org/10.1007/s00037-004-0182-6}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{AM11, author = {Aaronson, S. and van Melkebeek, D.}, title = {On Circuit Lower Bounds from Derandomization}, journal = {Theory of Computing}, volume = {7}, number = {1}, year = {2011}, pages = {177-184}, ee = {http://dx.doi.org/10.4086/toc.2011.v007a012}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{ASSS12, author = {Agrawal, M. and Saha, C. and Saptharishi, R. and Saxena, N.}, title = {Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas {\&} depth-3 transcendence degree-k circuits}, booktitle = {STOC}, year = {2012}, pages = {599-614}, ee = {http://doi.acm.org/10.1145/2213977.2214033}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{AS09, title = {{Classifying Polynomials and Identity Testing}}, author = {Agrawal, M. and Saptharishi, R.}, year = {2009}, journal = {Current Trends in Science}, pdf = {http://www.cse.iitk.ac.in/~manindra/survey/Identity.pdf} } @article{Sax09, title = {{Progress on Polynomial Identity Testing}}, author = {Saxena, N.}, journal = {Bull. EATCS}, volume = {99}, pages = {49-79}, year = {2009}, pdf = {http://eccc.uni-trier.de/report/2009/101/download} } @InProceedings{Agra05, author = {Agrawal, M.}, title ={Proving Lower Bounds via Pseudo-Random Generators}, booktitle ={Proc. FSTTCS 2005}, year = {2005}, note = {Invited paper} } @article{Pol22, author = {Pólya, G.}, title = {On the mean-value theorem corresponding to a given linear homogeneous differential equation}, year = {1922}, doi = {10.1090/S0002-9947-1922-1501228-5}, journal = {Transactions of the American Mathematical Society}, pages = {312-324}, volume = {24} } @article{NY95, author = {Novikov, D. and Yakovenko, S.}, title = { Simple exponential estimate for the number of real zeros of complete Abelian integrals}, journal = {Annales de l'institut Fourier}, volume = {45}, number = {4}, year = {1995}, pages = {897--927} } @article{GKS91, author = {Grigoriev, D. and Karpinski, M. and Singer, M.F.}, title = {The interpolation problem for k- sparse sums of eigenfunctions of operators}, journal = {Advances in Applied Mathematics}, volume = 12, number = 1, pages = {76--81}, year = 1991 } @article{GK93, author = {Grigoriev, D. and Karpinski, M.}, title = {A zero-test and an interpolation algorithm for the shifted sparse polynomials}, journal = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes}, pages = {162--169}, year = 1993 } @article{GKS94, author = {Grigoriev, D. and Karpinski, M. and Singer, M.F.}, title = {Computational complexity of sparse rational interpolation}, journal = {SIAM Journal on Computing}, volume = 23, number = 1, pages = {1--11}, year = 1994 }