A. Baker and G. Wüstholz, Logarithmic forms and group varieties, J. Reine Angew. Math, vol.442, pp.34-57, 1993.

O. Bastani, J. Christopher, D. Hillar, M. Popov, and . Rojas, Randomization, sums of squares, near-circuits, and faster real root counting, Contemporary Mathematics, vol.556, pp.145-166, 2011.

Y. Bugeaud, A. Dujella, T. Pejkovic, and B. Salvy, Absolute real root separation, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01655531

Y. Bugeaud and M. Mignotte, Polynomial root separation, International Journal of Number Theory, vol.6, issue.03, pp.587-602, 2010.

A. Cauchy, Mémoire sur la résolution des équations numériques et sur la théorie de l'élimination, 1829.

F. Cucker, P. Koiran, and S. Smale, A polynomial time algorithm for diophantine equations in one variable, Journal of Symbolic Computation, vol.27, issue.1, pp.21-29, 1999.
URL : https://hal.archives-ouvertes.fr/hal-02102070

K. Etessami, A. Stewart, and M. Yannakakis, A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing, ACM Transactions on Computation Theory (TOCT), vol.6, issue.2, p.9, 2014.

M. Israel, M. Gelfand, A. Kapranov, and . Zelevinsky, Discriminants, resultants, and multidimensional determinants, 1994.

H. W. Lenstra, Finding small degree factors of lacunary polynomials, Number Theory in Progress, pp.267-276, 1999.

G. Jindal and M. Sagraloff, A polynomial time algorithm for computing real roots of sparse real polynomials

G. Jindal and M. Sagraloff, A polynomial time algorithm for computing real roots of sparse real polynomials, Proc. ISSAC 2017 (42nd International Symposium on Symbolic and Algebraic Computation), 2017.

K. Mahler, An inequality for the discriminant of a polynomial, The Michigan Mathematical Journal, vol.11, issue.3, pp.257-262, 1964.

M. Marden, Number 3 in Mathematical Surveys and Monographs, 1966.

M. Marden, The search for a Rolle's theorem in the complex domain, The American Mathematical Monthly, vol.92, issue.9, pp.643-650, 1985.

M. Mignotte, Some useful bounds, Computer algebra, pp.259-263, 1982.
DOI : 10.1007/978-3-7091-7551-4_16

G. Qazi-ibadur-rahman and . Schmeisser, Number 26 in London Mathematical Society monographs (new series), 2002.

M. Rojas and Y. Ye, On solving univariate sparse polynomials in logarithmic time, Journal of Complexity, vol.21, issue.1, pp.87-110, 2005.
DOI : 10.1016/j.jco.2004.03.004
URL : https://doi.org/10.1016/j.jco.2004.03.004

M. Sagraloff, A near-optimal algorithm for computing real roots of sparse polynomials, Proc. ISSAC 2014 (39th International Symposium on Symbolic and Algebraic Computation), pp.359-366, 2014.
DOI : 10.1145/2608628.2608632
URL : http://arxiv.org/pdf/1401.6011