A. Alonso, E. Becker, M. Roy, and T. Wörmann, Multiplicities and idempotents 1675 for zerodimensional systems, Algorithms in Algebraic Geometry and Applications, pp.1674-1675, 1676.

M. Agrawal, N. Kayal, N. Saxena, Y. Bouzidi, S. Lazard et al., PRIMES is in P, Proceedings of the 1681 39th International Symposium on International Symposium on Symbolic and Algebraic 1682 Computation, pp.781-79314, 1679.
DOI : 10.4007/annals.2004.160.781

B. Y. Bouzidi, S. Lazard, M. Pouget, F. Rouillier, ]. S. Basu et al., Separating linear forms and 1684 rational univariate representations of bivariate systems, Algorithms in Real Algebraic Geometry, pp.1685-84

A. Bostan, B. Salvy, ]. D. Schostclo05, J. Cox, D. Little et al., Fast algorithms for zero-dimensional polyno- 1689 mial systems using duality Applicable Algebra in Engineering, Communication and 1690 Computing Using Algebraic Geometry. Number 185 in Graduate 1692 Texts in Mathematics On the asymptotic and practical 1694 complexity of solving bivariate systems over the reals, J. Symb. Comput, vol.14, issue.47, pp.239-272, 2003.

M. Kahoui, An elementary approach to subresultants theory, Journal of Symbolic Computation, vol.35, issue.3, pp.281-292, 1697.
DOI : 10.1016/S0747-7171(02)00135-9

M. Giusti, G. Lecerf, and B. Salvy, A Gr??bner Free Alternative for Polynomial System Solving, Journal of Complexity, vol.17, issue.1, pp.154-211, 2001.
DOI : 10.1006/jcom.2000.0571
URL : http://doi.org/10.1006/jcom.2000.0571

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

M. Kerber and M. Sagraloff, Root refinement for real polynomials using quadratic 1704 interval refinement, Journal of Computational and Applied Mathematics, issue.0, p.280377

]. X. Li, M. Moreno-maza, R. Rasheed, and . Schost, On the complexity of computing with planar algebraic 1707 curves The modpn library: Bringing 1709 fast polynomial arithmetic into maple, Journal of Complexity J. Symb. Comput, vol.31, issue.2LMMRS117, pp.1705-395, 2011.

R. Lebreton, E. Mehrabi, and . Schost, On the complexity of solving bivariate sys- 1711 tems: The case of non-singular solutions, Proceedings of the 38th International 1712 Symposium on International Symposium on Symbolic and Algebraic Computation, IS- 1713 SAC '13, pp.251-258, 2013.

T. Lickteig, M. Moenck, A. Borodinmsw15-]-k, M. Mehlhorn, P. Sagraloff et al., Sylvester-Habicht Sequences and Fast Cauchy Index 1715 Computation Fast modular transforms From approximate factorization to root 1719 isolation with application to cylindrical algebraic decomposition polynomials: Nearly optimal algorithms for numerical factor- 1722 ization and root-finding, Journal of Computer and 1717 System Sciences, pp.315-341, 1718.

D. Reischert, Asymptotically fast computation of subresultants, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.233-240, 1725.
DOI : 10.1145/258726.258792

F. Rouillier, Solving Zero-Dimensional Systems Through the Rational Univariate Representation, 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 1730 Symbolic Computation, p.1731, 2015.
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 1732 root isolation, Proceedings of the 36th International Symposium on Symbolic and 1733

C. Press and U. K. , Fundamental Problems of Algorithmic Algebra, pp.1736-1737, 2013.