B. Bank, M. Giusti, J. Heintz, G. Lecerf, G. Matera et al., Degeneracy Loci and Polynomial Equation Solving, Foundations of Computational Mathematics, vol.15, issue.1, pp.159-184, 2013.
DOI : 10.1007/s10208-014-9214-z

B. Bank, M. Giusti, J. Heintz, and G. Mbakop, Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case, Journal of Complexity, vol.13, issue.1, pp.5-27, 1997.
DOI : 10.1006/jcom.1997.0432

B. Bank, M. Giusti, J. Heintz, and L. M. Pardo, Generalized polar varieties: geometry and algorithms, Journal of Complexity, vol.21, issue.4, pp.377-412, 2005.
DOI : 10.1016/j.jco.2004.10.001

B. Bank, M. Giusti, J. Heintz, M. Safey-el-din, and E. Schost, On the geometry of polar varieties, Applicable Algebra in Engineering, Communication and Computing, vol.43, issue.2, pp.33-83, 2010.
DOI : 10.1007/s00200-009-0117-1

URL : https://hal.archives-ouvertes.fr/hal-01148162

I. Bannwarth and M. Safey-el-din, Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '15, 2015.
DOI : 10.1145/2755996.2756670

URL : https://hal.archives-ouvertes.fr/hal-01152751

S. Basu, R. Pollack, and M. Roy, Algorithms in real algebraic geometry, 2006.
DOI : 10.1007/978-3-662-05355-3

URL : https://hal.archives-ouvertes.fr/hal-01083587

S. Basu and M. Roy, Divide and Conquer Roadmap for Algebraic Sets, Discrete & Computational Geometry, vol.314, issue.5, pp.278-343, 2014.
DOI : 10.1007/s00454-014-9610-9

URL : https://hal.archives-ouvertes.fr/hal-00833308

S. Basu, M. Roy, M. Safey-el-din, and E. Schost, A Baby Step???Giant Step Roadmap Algorithm for General Algebraic Sets, Foundations of Computational Mathematics, vol.14, issue.6, pp.1117-1172, 2014.
DOI : 10.1007/s10208-014-9212-1

URL : https://hal.archives-ouvertes.fr/hal-01096209

F. Catanese, S. Ho¸stenho¸sten, A. Khetan, and B. Sturmfels, The maximum likelihood degree, American Journal of Mathematics, vol.128, issue.3, pp.671-697, 2006.
DOI : 10.1353/ajm.2006.0019

J. Draisma, E. Horobet, G. Ottaviani, B. Sturmfels, and R. R. Thomas, The Euclidean Distance Degree of an Algebraic Variety, Foundations of Computational Mathematics, vol.70, issue.2, pp.1-51, 2015.
DOI : 10.1007/s10208-014-9240-x

C. Durvye and G. Lecerf, A concise proof of the Kronecker polynomial system solver from scratch, Expositiones Mathematicae, vol.26, issue.2, pp.101-139, 2008.
DOI : 10.1016/j.exmath.2007.07.001

URL : https://hal.archives-ouvertes.fr/hal-00682083

D. Eisenbud, Commutative Algebra: with a view toward algebraic geometry, 2013.
DOI : 10.1007/978-1-4612-5350-1

D. Eisenbud and J. Harris, All that intersection theory in algebraic geometry, 2013.

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, Critical points and Gröbner bases: the unmixed case, Proceedings of ISSAC 2012, pp.162-169, 2012.

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, On the complexity of the generalized MinRank problem, Journal of Symbolic Computation, vol.55, pp.30-58, 2013.
DOI : 10.1016/j.jsc.2013.03.004

W. Fulton, Intersection theory, 2012.

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

A. Greuet and M. Safey-el-din, Deciding reachability of the infimum of a multivariate polynomial, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.131-138, 2011.
DOI : 10.1145/1993886.1993910

URL : https://hal.archives-ouvertes.fr/hal-00744469

A. Greuet and M. Safey-el-din, Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set, SIAM Journal on Optimization, vol.24, issue.3, pp.1313-1343, 2014.
DOI : 10.1137/130931308

URL : https://hal.archives-ouvertes.fr/hal-00849523

D. Y. Grigor-'ev and N. Vorobjov, Solving systems of polynomial inequalities in subexponential time, Journal of Symbolic Computation, vol.5, issue.1-2, pp.37-64, 1988.
DOI : 10.1016/S0747-7171(88)80005-1

J. Heintz, M. Roy, and P. Solernó, Description of the connected components of a semialgebraic set in single exponential time, Discrete & Computational Geometry, vol.4, issue.4, pp.121-140, 1994.
DOI : 10.1007/BF02573999

A. Holme, The geometric and numerical properties of duality in projective algebraic geometry, Manuscripta Mathematica, vol.6, issue.2, pp.145-162, 1988.
DOI : 10.1007/BF01259325

H. Hong and M. Safey-el-din, Variant quantifier elimination, Journal of Symbolic Computation, vol.47, issue.7, pp.883-901, 2012.
DOI : 10.1016/j.jsc.2011.05.014

URL : https://hal.archives-ouvertes.fr/hal-00778365

L. Kaup and B. Kaup, Holomorphic functions of several variables: an introduction to the fundamental theory, 1983.
DOI : 10.1515/9783110838350

E. Miller and B. Sturmfels, Combinatorial commutative algebra, 2005.

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

D. Northcott, SEMI-REGULAR RINGS AND SEMI-REGULAR IDEALS, The Quarterly Journal of Mathematics, vol.11, issue.1, pp.81-104, 1960.
DOI : 10.1093/qmath/11.1.81

R. Piene, Polar classes of singular varieties Annales Scientifiques de l'Ecole Normale Superieure, pp.247-276, 1978.

J. Renegar, On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals, Journal of Symbolic Computation, vol.13, issue.3, pp.255-299, 1992.
DOI : 10.1016/S0747-7171(10)80003-3

M. Safey-el-din, Computing the global optimum of a multivariate polynomial over the reals, Proc. of ISSAC 2008, pp.71-78, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01305635

M. Schost, Polar varieties and computation of one point in each connected component of a smooth real algebraic set, Proceedings of ISSAC 2003, pp.224-231, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099649

M. Schost, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Discrete & Computational Geometry, vol.45, issue.1, pp.181-220, 2011.

I. R. Shafarevich and K. A. Hirsch, Basic algebraic geometry, 1977.

P. Spaenlehauer, On the Complexity of Computing Critical Points with Gr??bner Bases, SIAM Journal on Optimization, vol.24, issue.3, pp.1382-1401, 2014.
DOI : 10.1137/130936294

B. L. Van-der-waerden, On Hilbert's function, series of composition of ideals and a generalization of the theorem of Bezout, Proc. Roy. Acad. Amsterdam, pp.749-770, 1929.

B. L. Van-der-waerden, On varieties in multiple-projective spaces, Indagationes Mathematicae (Proceedings), vol.81, issue.1, pp.303-312, 1978.
DOI : 10.1016/S1385-7258(78)80021-3