M. Alonso, E. Becker, M. Roy, and T. Wörmann, Multiplicities and idempotents for zerodimensional systems, Algorithms in Algebraic Geometry and Applications, vol.143, pp.1-20, 1996.

M. Agrawal, N. Kayal, and N. Saxena, Primes is in P. Ann. of Math, vol.160, issue.2, pp.781-793, 2004.

Y. Bouzidi, S. Lazard, M. Pouget, G. Moroz, and F. Rouillier, Improved algorithm for computing separating linear forms for bivariate systems, Proceedings of the 39th International Symposium on International Symposium on Symbolic and Algebraic Computation, ISSAC '14, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00992634

Y. Bouzidi, S. Lazard, M. Pouget, and F. Rouillier, Separating linear forms and rational univariate representations of bivariate systems, J. Symb. Comput, pp.84-119, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00977671

S. Basu, R. Pollack, and M. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol.10, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01083587

A. Bostan, B. Salvy, and . Schost, Fast algorithms for zero-dimensional polynomial systems using duality, Communication and Computing, vol.14, issue.4, pp.239-272, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072296

D. Cox, J. Little, and D. O'shea, Using Algebraic Geometry. Number 185 in Graduate Texts in Mathematics, 2005.

D. I. Diochnos, I. Z. Emiris, and E. P. Tsigaridas, On the asymptotic and practical complexity of solving bivariate systems over the reals, J. Symb. Comput, vol.44, issue.7, pp.818-835, 2009.

M. E. Kahoui, An elementary approach to subresultants theory, J. Symb. Comput, vol.35, issue.3, pp.281-292, 2003.
DOI : 10.1016/s0747-7171(02)00135-9
URL : https://doi.org/10.1016/s0747-7171(02)00135-9

M. Giusti, G. Lecerf, and B. Salvy, A Gröbner free alternative for solving polynomial systems, J. of Complexity, vol.17, issue.1, pp.154-211, 2001.
DOI : 10.1006/jcom.2000.0571
URL : https://doi.org/10.1006/jcom.2000.0571

L. González-vega and M. E. Kahoui, An improved upper complexity bound for the topology computation of a real algebraic plane curve, J. of Complexity, vol.12, issue.4, pp.527-544, 1996.

M. Kerber and M. Sagraloff, Root refinement for real polynomials using quadratic interval refinement, Journal of Computational and Applied Mathematics, vol.280, issue.0, pp.377-395, 2015.
DOI : 10.1016/j.cam.2014.11.031
URL : http://people.mpi-inf.mpg.de/%7Emsagralo/apx14.pdf

A. Kobel and M. Sagraloff, On the complexity of computing with planar algebraic curves, Journal of Complexity, vol.31, issue.2, pp.206-236, 2015.

X. Li, M. Moreno-maza, R. Rasheed, and . Schost, The modpn library: Bringing fast polynomial arithmetic into Maple, J. Symb. Comput, vol.46, issue.7, pp.841-858, 2011.
DOI : 10.1016/j.jsc.2010.08.016
URL : https://doi.org/10.1016/j.jsc.2010.08.016

T. Lickteig and M. Roy, Sylvester-Habicht Sequences and Fast Cauchy Index Computation, J. Symb. Comput, vol.31, issue.3, pp.315-341, 2001.
DOI : 10.1006/jsco.2000.0427
URL : https://doi.org/10.1006/jsco.2000.0427

R. Moenck and A. Borodin, Fast modular transforms, Journal of Computer and System Sciences, vol.8, pp.366-386, 1974.

E. Mehrabi and . Schost, A quasi-optimal monte carlo algorithm for the symbolic solution of polynomial systems in Z, 2015.

K. Mehlhorn, M. Sagraloff, and P. Wang, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, J. Symb. Comput, vol.66, issue.0, pp.34-69, 2015.
DOI : 10.1016/j.jsc.2014.02.001
URL : http://arxiv.org/pdf/1301.4870

V. Y. Pan, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, J. Symb. Comput, vol.33, issue.5, pp.701-733, 2002.
DOI : 10.1006/jsco.2002.0531
URL : https://doi.org/10.1006/jsco.2002.0531

D. Reischert, Asymptotically fast computation of subresultants, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC'97, pp.233-240, 1997.
DOI : 10.1145/258726.258792

F. Rouillier, Solving zero-dimensional systems through the rational univariate representation, J. of Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999.
DOI : 10.1007/s002000050114
URL : https://hal.archives-ouvertes.fr/inria-00073264

M. Sagraloff and K. Mehlhorn, Computing real roots of real polynomials, Journal of Symbolic Computation, vol.73, pp.46-86, 2016.
DOI : 10.1016/j.jsc.2015.03.004
URL : https://hal.archives-ouvertes.fr/hal-01363955

M. Sagraloff and C. K. Yap, A simple but exact and efficient algorithm for complex root isolation, Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, ISSAC '11, pp.353-360, 2011.

J. Von-zur-gathen and J. Gerhard, Modern Computer Algebra, 2013.

C. K. Yap, Fundamental Problems of Algorithmic Algebra, 2000.