D. Adrovic and J. Verschelde, A polyhedral method to compute all affine solution sets of sparse polynomial systems, 2013.

M. E. Alonso, E. Becker, M. Roy, and T. Wörmann, Zeroes, multiplicities and idempotents for zerodimensional systems, Algorithms in algebraic geometry and applications. Proceedings of MEGA'94, pp.1-15, 1996.
DOI : 10.1007/978-3-0348-9104-2_1

URL : http://www.math.fsu.edu/~woermann/ABRW.ps

M. Atiyah and I. Macdonald, Introduction to Commutative Algebra, 1969.

P. Aubry, F. Rouillier, and M. , Real Solving for Positive Dimensional Systems, Journal of Symbolic Computation, vol.34, issue.6, pp.543-560, 2002.
DOI : 10.1006/jsco.2002.0563

URL : https://hal.archives-ouvertes.fr/inria-00100982

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, 2015.
DOI : 10.1007/978-3-662-21581-4

URL : http://arxiv.org/pdf/1306.3390

B. Bank, M. Giusti, J. Heintz, and G. Mbakop, Polar varieties and efficient real elimination, Mathematische Zeitschrift, vol.238, issue.1, pp.115-144, 2001.
DOI : 10.1007/PL00004896

URL : http://arxiv.org/pdf/math/0005041

B. Bank, M. Giusti, J. Heintz, and L. 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

URL : https://doi.org/10.1016/j.jco.2004.10.001

B. Bank, M. Giusti, J. Heintz, and M. , Intrinsic complexity estimates in polynomial optimization, Journal of Complexity, vol.30, issue.4, pp.430-443, 2014.
DOI : 10.1016/j.jco.2014.02.005

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

B. Bank, M. Giusti, J. Heintz, and M. , Safey El Din, andÉand´andÉ. Schost. On the geometry of polar varieties, Applicable Algebra in Engineering, Communication and Computing, pp.33-83, 2010.

S. Basu, M. Roy, and M. , 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.1016/0196-8858(83)90014-3

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

D. J. Bates, D. A. Brake, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler, On Computing a Cell Decomposition of a Real Surface Containing Infinitely Many Singularities, Mathematical software?ICMS 2014, pp.246-252, 2014.
DOI : 10.1007/978-3-662-44199-2_39

D. J. Bates, J. D. Hauenstein, C. Peterson, and A. J. Sommese, A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations, SIAM Journal on Numerical Analysis, vol.47, issue.5, pp.3608-3623, 2009.
DOI : 10.1137/08073264X

D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler, Numerically solving polynomial systems with Bertini, Software, Environments, and Tools. Society for Industrial and Applied Mathematics (SIAM), vol.25, 2013.

G. M. Besana, S. Di-rocco, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler, Cell decomposition of almost smooth real algebraic surfaces, Numerical Algorithms, vol.20, issue.2, pp.645-678, 2013.
DOI : 10.1017/S0962492911000067

A. Bompadre, G. Matera, R. Wachenchauzer, and A. Waissbein, Polynomial equation solving by lifting procedures for ramified fibers, Theoretical Computer Science, vol.315, issue.2-3, pp.335-369, 2004.
DOI : 10.1016/j.tcs.2004.01.015

URL : https://doi.org/10.1016/j.tcs.2004.01.015

D. A. Brake, D. J. Bates, W. Hao, J. D. Hauenstein, A. J. Sommese et al., Algorithm 976, ACM Transactions on Mathematical Software, vol.44, issue.1, p.30, 2017.
DOI : 10.1115/1.2916909

A. Conca and J. Herzog, On the Hilbert function of determinantal rings and their canonical module, Proceedings of the, pp.677-681, 1994.
DOI : 10.1090/S0002-9939-1994-1213858-0

D. A. Cox, J. Little, and D. O. Shea, Using algebraic geometry, Graduate Texts in Mathematics, vol.185, 2005.
DOI : 10.1007/978-1-4757-6911-1

X. Dahan and . Schost, Sharp estimates for triangular sets, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.103-110, 2004.
DOI : 10.1145/1005285.1005302

J. , D. Dora, C. Discrescenzo, and D. Duval, About a new method for computing in algebraic number fields, EUROCAL'85, pp.289-290

J. Eagon and D. Northcott, Ideals Defined by Matrices and a Certain Complex Associated with Them, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.269, issue.1337, pp.188-204, 1337.
DOI : 10.1098/rspa.1962.0170

D. Eisenbud, Commutative algebra with a view toward algebraic geometry, Graduate Texts in Mathematics, vol.150, 1995.

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, Critical points and gr¨Obnergr¨ gr¨Obner bases: The unmixed case, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 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

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065

P. Gianni and T. Mora, Algebraic solution of systems of polynomial equations using Groebner bases, AAECC, pp.247-257, 1989.

M. Giusti, J. Heintz, J. Morais, J. Morgenstern, and L. Pardo, Straight-line programs in geometric elimination theory, Journal of Pure and Applied Algebra, vol.124, issue.1-3, pp.101-146, 1998.
DOI : 10.1016/S0022-4049(96)00099-0

M. Giusti, J. Heintz, J. Morais, and L. Pardo, When polynomial equation systems can be solved fast? In AAECC-11, LNCS, vol.948, pp.205-231, 1995.

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, 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

F. Guo, M. Safey-el-din, and L. Zhi, Global optimization of polynomials using generalized critical values and sums of squares, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.107-114, 2010.
DOI : 10.1145/1837934.1837960

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

J. D. Hauenstein, Numerically Computing Real Points on Algebraic Sets, Acta Applicandae Mathematicae, vol.46, issue.9, pp.105-119, 2013.
DOI : 10.1016/j.mechmachtheory.2011.04.011

URL : http://arxiv.org/pdf/1105.6266

J. Heintz, G. Jeronimo, J. Sabia, and P. Solerno, Intersection theory and deformation algorithms: the multi-homogeneous case, 2002.

J. Heintz, T. Krick, S. Puddu, J. Sabia, and A. Waissbein, Deformation Techniques for Efficient Polynomial Equation Solving, Journal of Complexity, vol.16, issue.1, pp.70-109, 2000.
DOI : 10.1006/jcom.1999.0529

URL : https://doi.org/10.1006/jcom.1999.0529

M. I. Herrero, G. Jeronimo, and J. Sabia, Computing isolated roots of sparse polynomial systems in affine space, Theoretical Computer Science, vol.411, issue.44-46, pp.4113894-3904, 2010.
DOI : 10.1016/j.tcs.2010.07.015

M. I. Herrero, G. Jeronimo, and J. Sabia, Affine solution sets of sparse polynomial systems, Journal of Symbolic Computation, vol.51, pp.34-54, 2013.
DOI : 10.1016/j.jsc.2012.03.006

M. I. Herrero, G. Jeronimo, and J. Sabia, Elimination for Generic Sparse Polynomial Systems, Discrete & Computational Geometry, vol.16, issue.1, pp.578-599, 2014.
DOI : 10.1007/978-1-4615-3188-3

URL : http://arxiv.org/pdf/1303.0266

G. Jeronimo, G. Matera, P. Solerno, and A. Waissbein, Deformation Techniques for Sparse Systems, Foundations of Computational Mathematics, vol.31, issue.3, pp.1-50, 2009.
DOI : 10.1007/978-1-4615-3188-3

URL : http://arxiv.org/pdf/math/0608714

G. Jeronimo and D. Perrucci, A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set, Discrete & Computational Geometry, vol.17, issue.3, pp.260-277, 2014.
DOI : 10.1137/050647098

L. Kronecker, Grundzüge einer arithmetischen Theorie der algebraischen Grössen, Journal für die reine und angewandte Mathematik, pp.1-122

A. Leykin, A. M. Del-campo, F. Sottile, R. Vakil, and J. Verschelde, Numerical schubert calculus via the littlewood-richardson homotopy algorithm. arXiv preprint, 2018.

F. S. Macaulay, The Algebraic Theory of Modular Systems, 1916.

H. Matsumura, Commutative Ring Theory. Cambridge studies in advanced mathematics, 1986.
DOI : 10.1017/cbo9781139171762

E. Miller and B. Sturmfels, Combinatorial Commutative Algebra, 2005.

B. Mourrain, Isolated points, duality and residues, Journal of Pure and Applied Algebra, vol.117, issue.118, pp.469-493, 1996.
DOI : 10.1016/S0022-4049(97)00023-6

URL : https://hal.archives-ouvertes.fr/inria-00125278

J. Nie, J. Demmel, and B. Sturmfels, Minimizing Polynomials via Sum of Squares over the Gradient Ideal, Mathematical Programming, vol.13, issue.3, pp.587-606, 2006.
DOI : 10.4153/CMB-2003-054-7

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

F. Rouillier, Solving zero-dimensional systems through the Rational Univariate Representation Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999.

F. Rouillier, M. Roy, and M. , Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation, Journal of Complexity, vol.16, issue.4, pp.716-750, 2000.
DOI : 10.1006/jcom.2000.0563

URL : https://hal.archives-ouvertes.fr/inria-00099275

M. Schost, Polar varieties and computation of one point in each connected component of a smooth real algebraic set, ISSAC'03, 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 and Computational Geometry, vol.45, issue.1, pp.181-220, 2011.

M. Schost, Bit complexity for multi-homogeneous polynomial system solving application to polynomial minimization, Journal of Symbolic Computation, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01319729

M. Schost, A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets, J. ACM, vol.63, issue.6, pp.48-49, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00849057

M. Safey-el-din and P. Spaenlehauer, Critical Point Computations on Smooth Varieties, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '16, pp.183-190, 2016.
DOI : 10.1016/S1385-7258(78)80021-3

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

´. E. Schost, Computing Parametric Geometric Resolutions, Applicable Algebra in Engineering, Communication and Computing, vol.13, issue.5, pp.349-393, 2003.
DOI : 10.1007/s00200-002-0109-x

URL : http://www.gage.polytechnique.fr/~schost/publications/parametr.ps

I. Shafarevich, Basic Algebraic Geometry 1, 1977.
DOI : 10.1007/978-3-642-37956-7

M. Shub and S. Fssmale, Complexity of bezout's theorem i: Geometric aspects, Journal of the American Mathematical Society, vol.6, issue.2, pp.459-501, 1993.

A. J. Sommese and C. W. Wampler, The numerical solution of systems of polynomials arising in engineering and science, World Scientific, 2005.
DOI : 10.1142/5763

F. Sottile, R. Vakil, and J. Verschelde, Solving Schubert problems with littlewoodrichardson homotopies, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, pp.179-186, 2010.
DOI : 10.1145/1837934.1837971

URL : http://arxiv.org/pdf/1001.4125

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

J. Verschelde, Polyhedral methods in numerical algebraic geometry, Contemporary Mathematics, vol.496, p.243, 2009.
DOI : 10.1090/conm/496/09727

J. Verschelde, P. Verlinden, and R. Cools, Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems, SIAM Journal on Numerical Analysis, vol.31, issue.3, pp.915-930, 1994.
DOI : 10.1137/0731049

O. Zariski and P. Samuel, Commutative Algebra, 1958.
DOI : 10.1007/978-3-662-29244-0