]. J. Abb06 and . Abbott, Quadratic interval refinement for real roots, 2006.

S. [. Arnon and . Mccallum, A polynomial time algorithm for the topological type of a real algebraic curve, JSC, vol.5, pp.213-236, 1988.

H. [. Brieskorn and . Knörrer, Plane Algebraic Curves, 1986.

R. [. Basu, M. Pollack, and . Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol.10, 2006.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

]. J. Can88 and . Canny, Some algebraic and geometric computations in PSPACE, Proc. STOC, pp.460-467, 1988.

[. Cazals, J. Faugère, M. Pouget, and F. Rouillier, The implicit structure of ridges of a smooth parametric surface, Computer Aided Geometric Design, vol.23, issue.7, pp.582-598, 2006.
DOI : 10.1016/j.cagd.2006.04.002
URL : https://hal.archives-ouvertes.fr/inria-00071237

I. [. Diochnos, E. P. Emiris, and . Tsigaridas, On the complexity of real solving bivariate systems, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, 2007.
DOI : 10.1145/1277548.1277567
URL : https://hal.archives-ouvertes.fr/inria-00129309

V. [. Du, C. K. Sharma, and . Yap, Amortized Bound for Root Isolation via Sturm Sequences, Int. Workshop on Symbolic Numeric Computing, pp.81-93, 2005.
DOI : 10.1007/978-3-7643-7984-1_8

B. [. Emiris, E. P. Mourrain, and . Tsigaridas, Real Algebraic Numbers: Complexity Analysis and Experimentation, Reliable Implementations of Real Number Algorithms: Theory and Practice, 2007.
DOI : 10.1007/978-3-540-85521-7_4

V. [. Eigenwillig, C. K. Sharma, and . Yap, Almost tight recursion tree bounds for the Descartes method, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.71-78, 2006.
DOI : 10.1145/1145768.1145786

E. [. Emiris and . Tsigaridas, Real Solving of Bivariate Polynomial Systems
DOI : 10.1007/11555964_13

M. [. González-vega and . Kahoui, An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve, Journal of Complexity, vol.12, issue.4, pp.527-544, 1996.
DOI : 10.1006/jcom.1996.0032

H. [. González-vega, T. Lombardi, M. Recio, and . Roy, Sturm-Habicht Sequence, ISSAC, pp.136-146, 1989.

I. [. Gonzalez-vega and . Necula, Efficient topology determination of implicitly defined algebraic plane curves, Computer Aided Geometric Design, vol.19, issue.9, pp.719-743, 2002.
DOI : 10.1016/S0167-8396(02)00167-X

]. M. Ker06 and . Kerber, Analysis of real algebraic plane curves, 2006.

]. J. Klo95 and . Klose, Binary segmentation for multivariate polynomials, J. Complexity, vol.11, issue.3, pp.330-343, 1995.

T. [. Ko, N. M. Sakkalis, and . Patrikalakis, RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS, International Journal of Shape Modeling, vol.11, issue.01, pp.121-147, 2005.
DOI : 10.1142/S021865430500075X

M. [. Lickteig and . Roy, Sylvester???Habicht Sequences and Fast Cauchy Index Computation, Journal of Symbolic Computation, vol.31, issue.3, pp.315-341, 2001.
DOI : 10.1006/jsco.2000.0427
URL : http://doi.org/10.1006/jsco.2000.0427

]. P. Mil92 and . Milne, On the solution of a set of polynomial equations, Symbolic and Numerical Computation for Artificial Intelligence, pp.89-102, 1992.

J. [. Mourrain and . Pavone, Subdivision methods for solving polynomial equations, Journal of Symbolic Computation, vol.44, issue.3, 2005.
DOI : 10.1016/j.jsc.2008.04.016
URL : https://hal.archives-ouvertes.fr/inria-00070350

S. Bernard-mourrain, S. Pion, J. Schmitt, E. Técourt, N. Tsigaridas et al., Algebraic issues in computational geometry, Effective Computational Geometry for Curves and Surfaces, pp.117-155, 2006.

D. [. Mignotte and . Stefanescu, Polynomials: An algorithmic approach, 1999.

P. [. Mourrain and . Trébuchet, Solving projective complete intersection faster, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00
DOI : 10.1145/345542.345642
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7274

A. Neumaier, Interval Methods for Systems of Equations, 1990.
DOI : 10.1017/CBO9780511526473

]. V. Pan02 and . Pan, Univariate polynomials, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.701-733, 2002.
DOI : 10.1145/384101.384136

I. Pedersen, M. Roy, and A. Szpirglas, Counting real zeros in the multivariate case, Computational Algebraic Geometry, pp.203-224, 1993.
DOI : 10.1007/978-1-4612-2752-6_15

]. D. Rei97 and . Reischert, Asymptotically fast computation of subresultants, ISSAC, pp.233-240, 1997.

]. J. [-ren89 and . Renegar, On the worst-case arithmetic complexity of approximating zeros of systems of polynomials, SIAM J. Computing, vol.18, pp.350-370, 1989.

]. F. Rou99 and . Rouillier, Solving zero-dimensional systems through the rational univariate representation, J. of AAECC, vol.9, issue.5, pp.433-461, 1999.

]. T. Sak89 and . Sakkalis, Signs of algebraic numbers, Computers and Mathematics, pp.131-134, 1989.

R. [. Sakkalis and . Farouki, Singular points of algebraic curves, Journal of Symbolic Computation, vol.9, issue.4, pp.405-421, 1990.
DOI : 10.1016/S0747-7171(08)80019-3

]. M. Van-hoeij and M. Monagan, A modular GCD algorithm over number fields presented with multiple extensions, Proceedings of the 2002 international symposium on Symbolic and algebraic computation , ISSAC '02, pp.109-116, 2002.
DOI : 10.1145/780506.780520

R. [. Wolpert and . Seidel, On the Exact Computation of the Topology of Real Algebraic Curves, SoCG, pp.107-115, 2005.

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

L. Unité-de-recherche-inria-lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4

I. Unité-de-recherche and . Rennes, IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004.

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399