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

Y. Bouzidi, S. Lazard, M. Pouget, and F. Rouillier, Solving bivariate systems: Efficient worst-case algorithm for computing rational univariate representations and applications, INRIA Research Report, vol.8262, 2013.

R. [. Basu, M. Pollack, and . Roy, Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics, BSS03] A. Bostan, B. Salvy, and É. Schost. Fast algorithms for zero-dimensional polynomial systems using duality. Applicable Algebra in Engineering, Communication and Computing, pp.239-272, 2003.

D. Cox, J. Little, and D. Shea, Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics, 1997.

I. [. Diochnos, E. P. Emiris, and . Tsigaridas, On the asymptotic and practical complexity of solving bivariate systems over the reals, Journal of Symbolic Computation, vol.44, issue.7, pp.818-835281, 2003.
DOI : 10.1016/j.jsc.2008.04.009

M. [. Emeliyanenko and . Sagraloff, On the complexity of solving a bivariate polynomial system, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, p.12, 2012.
DOI : 10.1145/2442829.2442854

G. [. Giusti, B. Lecerf, and . 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

L. González-vega and M. Kahoui, An improved upper complexity bound for the topology computation of a real algebraic plane curve [GVN02] L. González-Vega and I. Necula. Efficient topology determination of implicitly defined algebraic plane curves, J. Complexity Computer Aided Geometric Design, vol.12, issue.199, pp.527-544, 1996.

M. [. Kerber and . Sagraloff, A worst-case bound for topology computation of algebraic curves, Journal of Symbolic Computation, vol.47, issue.3, 1104.
DOI : 10.1016/j.jsc.2011.11.001

M. [. Kerber and . Sagraloff, A worst-case bound for topology computation of algebraic curves, Journal of Symbolic Computation, vol.47, issue.3, pp.239-258, 2012.
DOI : 10.1016/j.jsc.2011.11.001

]. D. Laz91 and . Lazard, A new method for solving algebraic systems of positive dimension, Discrete Appl. Math, vol.33, pp.147-160, 1991.

M. [. Li, R. Moreno-maza, É. Rasheed, and . Schost, The modpn library, ACM SIGSAM Bulletin, vol.42, issue.3, pp.841-858, 2011.
DOI : 10.1145/1504347.1504374

A. [. Moenck and . Borodin, Fast modular transforms, Journal of Computer and System Sciences, vol.8, 1974.

]. D. Rei97 and . Reischert, Asymptotically fast computation of subresultants, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, ISSAC '97, pp.233-240, 1997.

]. F. Rou99 and . 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.

]. M. Sag12 and . Sagraloff, When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial, Proceedings of the 37th international symposium on Symbolic and algebraic computation, p.12, 2012.

]. B. Vdw30, J. Van-der-waerden, J. Zur-gathen, and . Gerhard, Moderne Algebra I. Berlin Modern Computer Algebra, 1930.

]. C. Yap00 and . Yap, Fundamental Problems of Algorithmic Algebra, 2000.