Randomization, sums of squares, near-circuits, and faster real root counting, Contemporary Mathematics, vol.556, pp.145-166, 2011. ,
DOI : 10.1090/conm/556/11012
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.9165
Absolute real root separation. arXiv preprint, 2016. ,
POLYNOMIAL ROOT SEPARATION, International Journal of Number Theory, vol.71, issue.03, pp.587-602, 2010. ,
DOI : 10.1007/BFb0073786
A Polynomial Time Algorithm for Diophantine Equations in One Variable, Journal of Symbolic Computation, vol.27, issue.1, pp.21-29, 1999. ,
DOI : 10.1006/jsco.1998.0242
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing, ACM Transactions on Computation Theory, vol.6, issue.2, p.9, 2014. ,
DOI : 10.4153/CJM-1993-010-1
A polynomial time algorithm for computing real roots of sparse real polynomials, Proc. ISSAC 2017 (42nd International Symposium on Symbolic and Algebraic Computation, 2017. ,
Finding small degree factors of lacunary polynomials, Number Theory in Progress, pp.267-276, 1999. ,
DOI : 10.1515/9783110285581.267
An inequality for the discriminant of a polynomial., The Michigan Mathematical Journal, vol.11, issue.3, pp.257-262, 1964. ,
DOI : 10.1307/mmj/1028999140
Geometry of polynomials. Number 3 in Mathematical Surveys and Monographs, 1966. ,
The Search for a Rolle's Theorem in the Complex Domain, The American Mathematical Monthly, vol.92, issue.9, pp.643-650, 1985. ,
DOI : 10.2307/2323710
Some useful bounds, Computer algebra, pp.259-263, 1982. ,
DOI : 10.1007/978-3-7091-3406-1_16
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
A near-optimal algorithm for computing real roots of sparse polynomials, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.359-366, 2014. ,
DOI : 10.1145/2608628.2608632