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

C. Beltrán and A. Leykin, Robust Certified Numerical Homotopy Tracking, Foundations of Computational Mathematics, vol.25, issue.2, pp.253-295, 2013.
DOI : 10.1007/s10208-013-9143-2

L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, 1998.
DOI : 10.1007/978-1-4612-0701-6

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

K. A. Hansen, M. Koucky, N. Lauritzen, P. B. Miltersen, and E. P. Tsigaridas, Exact algorithms for solving stochastic games, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, 2011.
DOI : 10.1145/1993636.1993665

K. A. Hansen, M. Koucky, and P. B. Miltersen, Winning Concurrent Reachability Games Requires Doubly-Exponential Patience, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.332-341, 2009.
DOI : 10.1109/LICS.2009.44
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.996

G. Malajovich, Condition Number Bounds for Problems with Integer Coefficients, Journal of Complexity, vol.16, issue.3, pp.529-551, 2000.
DOI : 10.1006/jcom.2000.0552

M. Mignotte, Mathematics for Computer Algebra, 1991.
DOI : 10.1007/978-1-4613-9171-5

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