C. Bajaj, The algebraic degree of geometric optimization problems, Discrete & Computational Geometry, vol.27, issue.39, pp.177-191, 1988.
DOI : 10.1007/BF02187906

S. Basu, R. Pollack, and M. 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

S. Basu and M. Roy, Bounding the radii of balls meeting every connected component of semi-algebraic sets, Journal of Symbolic Computation, vol.45, issue.12, pp.1270-1279, 2010.
DOI : 10.1016/j.jsc.2010.06.009
URL : https://hal.archives-ouvertes.fr/hal-00459481

J. Canny, The Complexity of Robot Motion Planning, ACM Doctoral Dissertation Award Series, 1987.

I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas, The DMM bound, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.243-250, 2010.
DOI : 10.1145/1837934.1837981
URL : https://hal.archives-ouvertes.fr/inria-00393833

I. M. Gel, ?. Fand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, resultants, and multidimensional determinants, Birkhäuser Boston Inc, 1994.

H. Graf-von-bothmer and K. Ranestad, A general formula for the algebraic degree in semidefinite programming, Bulletin of the London Mathematical Society, vol.41, issue.2, pp.193-197, 2009.
DOI : 10.1112/blms/bdn114

K. A. Hansen, M. Koucky, N. Lauritzen, P. B. Miltersen, and E. P. Tsigaridas, Exact algorithms for solving stochastic games (extended abstract), STOC'11?Proceedings of the 43rd ACM Symposium on Theory of Computing, pp.205-214, 2011.

K. A. Hansen, M. Koucky, N. Lauritzen, P. B. Miltersen, and E. P. Tsigaridas, Separation bounds for real roots of polynomial systems, Proc. 11th Int. Symp. on Effective Methods in Algebraic Geometry (MEGA), 2011.

G. Jeronimo and D. Perrucci, On the minimum of a positive polynomial over the standard simplex, Journal of Symbolic Computation, vol.45, issue.4, pp.434-442, 2010.
DOI : 10.1016/j.jsc.2010.01.001

G. Jeronimo, D. Perrucci, and J. Sabia, On Sign Conditions Over Real Multivariate Polynomials, Discrete & Computational Geometry, vol.60, issue.5, pp.195-222, 2010.
DOI : 10.1007/s00454-009-9200-4

A. Mantzaflaris, B. Mourrain, and E. P. Tsigaridas, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, Theoretical Computer Science, vol.412, issue.22, pp.2312-2330, 2011.
DOI : 10.1016/j.tcs.2011.01.009
URL : https://hal.archives-ouvertes.fr/inria-00530756

M. Mignotte and D. , Polynomials: An algorithmic approach, 1999.

J. Nie and K. Ranestad, Algebraic Degree of Polynomial Optimization, SIAM Journal on Optimization, vol.20, issue.1, pp.485-502, 2009.
DOI : 10.1137/080716670

J. Nie, K. Ranestad, and B. Sturmfels, The algebraic degree of semidefinite programming, Mathematical Programming, vol.296, issue.12, pp.379-405, 2010.
DOI : 10.1007/s10107-008-0253-6

J. Nocedal and S. J. Wright, Numerical optimization. Springer Series in Operations Research, 1999.

M. Schweighofer, On the complexity of Schm??dgen's Positivstellensatz, Journal of Complexity, vol.20, issue.4, pp.529-543, 2004.
DOI : 10.1016/j.jco.2004.01.005

I. R. Shafarevich, Basic algebraic geometry 1, 1994.

M. Sombra, The height of the mixed sparse resultant, American Journal of Mathematics, vol.126, issue.6, pp.1253-1260, 2004.
DOI : 10.1353/ajm.2004.0050
URL : https://hal.archives-ouvertes.fr/hal-00119390

J. C. Yakoubsohn, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Journal of Complexity, vol.21, issue.5, pp.652-690, 2005.
DOI : 10.1016/j.jco.2005.06.007