\begin{thebibliography}{10} \bibitem{AM11} S.~Aaronson and D.~van Melkebeek. \newblock On circuit lower bounds from derandomization. \newblock {\em Theory of Computing}, 7(1):177--184, 2011. \bibitem{Agra05} M.~Agrawal. \newblock Proving lower bounds via pseudo-random generators. \newblock In {\em Proc. FSTTCS 2005}, 2005. \newblock Invited paper. \bibitem{AS09} M.~Agrawal and R.~Saptharishi. \newblock {Classifying Polynomials and Identity Testing}. \newblock {\em Current Trends in Science}, 2009. \bibitem{Ave09} M.~Avenda\~no. \newblock The number of roots of a lacunary bivariate polynomial on a line. \newblock {\em Journal of Symbolic Computation}, 44(9):1280 -- 1284, 2009. \bibitem{Bo1900a} M.~B\^ocher. \newblock On linear dependence of functions of one variable. \newblock {\em Bull. Amer. Math. Soc.}, 7:120--121, 1900. \bibitem{Bo1900b} M.~B\^ocher. \newblock The theory of linear dependence. \newblock {\em The Annals of Mathematics}, 2(1/4):81--96, 1900. \bibitem{Burg} P.~B\"urgisser. \newblock {\em Completeness and Reduction in Algebraic Complexity Theory}. \newblock Number~7 in Algorithms and Computation in Mathematics. Springer, 2000. \bibitem{HistWr} S.M. Engdahl and A.E. Parker. \newblock Peano on wronskians: A translation. \newblock \url{http://mathdl.maa.org/mathDL/46/?pa=content&sa=viewDocument&nodeId=3642&pf=1}. \bibitem{Fro76} G.F. Frobenius. \newblock {\"Ueber die Determinante mehrerer Functionen einer Variabeln}. \newblock {\em {Journal f\"ur die reine und angewandte Mathematik (Crelle's Journal)}}, 1874:245--257, 1874. \bibitem{GKPS11} B.~Grenet, P.~Koiran, N.~Portier, and Y.~Strozecki. \newblock The limited power of powering : Polynomial identity testing and a depth-four lower bound for the permanent. \newblock In {\em IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, volume~13 of {\em Leibniz International Proceedings in Informatics (LIPIcs)}, pages 127--139, 2011. \bibitem{GK93} D.~Grigoriev and M.~Karpinski. \newblock A zero-test and an interpolation algorithm for the shifted sparse polynomials. \newblock {\em Applied Algebra, Algebraic Algorithms and Error-Correcting Codes}, pages 162--169, 1993. \bibitem{GKS91} D.~Grigoriev, M.~Karpinski, and M.F. Singer. \newblock The interpolation problem for k- sparse sums of eigenfunctions of operators. \newblock {\em Advances in Applied Mathematics}, 12(1):76--81, 1991. \bibitem{GKS94} D.~Grigoriev, M.~Karpinski, and M.F. Singer. \newblock Computational complexity of sparse rational interpolation. \newblock {\em SIAM Journal on Computing}, 23(1):1--11, 1994. \bibitem{HS80} J.~Heintz and C.P. Schnorr. \newblock Testing polynomials which are easy to compute (extended abstract). \newblock In {\em STOC}, pages 262--272, 1980. \bibitem{Hur90} W.~Hurewicz. \newblock {\em Lectures on ordinary differential equations}. \newblock Dover edition, 1990. \bibitem{KI04} V.~Kabanets and R.~Impagliazzo. \newblock Derandomizing polynomial identity tests means proving circuit lower bounds. \newblock {\em Computational Complexity}, 13(1-2):1--46, 2004. \bibitem{Kh91} A.G. Khovanski\u{\i}. \newblock {\em Fewnomials}. \newblock Translations of Mathematical Monographs. American Mathematical Society, 1991. \bibitem{Koi10} P.~Koiran. \newblock Shallow circuits with high-powered inputs. \newblock In {\em Proceedings of the Second Symposium on Innovations in Computer Science,}, pages 309--320, 2011. \bibitem{LRW03} T.Y. Li, J.M. Rojas, and X.~Wang. \newblock {Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces}. \newblock {\em Discrete \& Computational Geometry}, 30:379--414, 2003. \bibitem{NY95} D.~Novikov and S.~Yakovenko. \newblock Simple exponential estimate for the number of real zeros of complete abelian integrals. \newblock {\em Annales de l'institut Fourier}, 45(4):897--927, 1995. \bibitem{Pea1889a} G.~Peano. \newblock Sur le d\'eterminant wronskien. \newblock {\em Mathesis}, 9:75--76, 1889. \bibitem{Pea1889b} G.~Peano. \newblock Sur les wronskiens. \newblock {\em Mathesis}, 9:110--112, 1889. \bibitem{PoSz76} G.~P\'olya and G.~Szeg\H{o}. \newblock {\em Problems and Theorems in Analysis. Volume II}. \newblock Springer, 1976. \bibitem{Pol22} G.~PĆ³lya. \newblock On the mean-value theorem corresponding to a given linear homogeneous differential equation. \newblock {\em Transactions of the American Mathematical Society}, 24:312--324, 1922. \bibitem{Sax09} N.~Saxena. \newblock {Progress on Polynomial Identity Testing}. \newblock {\em Bull. EATCS}, 99:49--79, 2009. \bibitem{ShSm95} M.~Shub and S.~Smale. \newblock {On the intractability of Hilbert's Nullstellensatz and an algebraic version of {P}={NP}}. \newblock {\em Duke Mathematical Journal}, 81(1):47--54, 1995. \bibitem{Valiant82} L.~G. Valiant. \newblock Reducibility by algebraic projections. \newblock In {\em Logic and Algorithmic (an International Symposium held in honour of {Ernst Specker})}, pages 365--380. Monographie $n^{\tiny o}$ 30 de L'Enseignement Math\'ematique, 1982. \bibitem{VP75} M.~Voorhoeve and A.J. Van Der~Poorten. \newblock Wronskian determinants and the zeros of certain functions. \newblock {\em Indagationes Mathematicae (Proceedings)}, 78(5):417 -- 424, 1975. \end{thebibliography}