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.

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 G. Mbakop, Polar varieties and efficient real elimination, Mathematische Zeitschrift, vol.238, issue.1, pp.115-144, 2001.
DOI : 10.1007/PL00004896

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

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

A. Barvinok, Feasibility testing for systems of real quadratic equations, Discrete & Computational Geometry, vol.13, issue.3, pp.1-13, 1993.
DOI : 10.1016/S0747-7171(10)80005-7

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

W. Baur and V. Strassen, The complexity of partial derivatives, Theoretical Computer Science, vol.22, issue.3, pp.317-330, 1983.
DOI : 10.1016/0304-3975(83)90110-X

M. Celis, J. Dennis, and R. Tapia, A trust region strategy for nonlinear equality constrained optimization . Numerical optimization, pp.71-82, 1984.

X. Dahan, M. Moreno-maza, ´. E. Schost, W. Wu, and Y. Xie, Lifting techniques for triangular decompositions, Proceedings of the 2005 international symposium on Symbolic and algebraic computation , ISSAC '05, pp.108-115, 2005.
DOI : 10.1145/1073884.1073901

C. D. Andrea, T. Krick, and M. Sombra, Heights of varieties in multiprojective spaces and arithmetic Nullstellensätze, Annales scientifiques de l'ENS, pp.549-627, 2013.

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

I. Emiris, A. Mantzaflaris, and E. Tsigaridas, On the Bit Complexity of Solving Bilinear Polynomial Systems, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '16, pp.215-222, 2016.
DOI : 10.1017/CBO9780511546556
URL : https://hal.archives-ouvertes.fr/hal-01401134

I. Emiris and A. Mantzaflaris, Multihomogeneous resultant formulae for systems with scaled support, Journal of Symbolic Computation, vol.47, issue.7, pp.820-842, 2012.
DOI : 10.1016/j.jsc.2011.12.010

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

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, J. Heintz, J. Morais, and L. Pardo, Le r??le des structures de donn??es dans les probl??mes d'??limination, Comptes Rendus de l'Acad??mie des Sciences - Series I - Mathematics, vol.325, issue.11, pp.1223-1228, 1997.
DOI : 10.1016/S0764-4442(97)83558-6

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

B. Grenet, P. Koiran, and N. Portier, On the complexity of the multivariate resultant, Journal of Complexity, vol.29, issue.2, pp.142-157, 2013.
DOI : 10.1016/j.jco.2012.10.001
URL : https://hal.archives-ouvertes.fr/ensl-00744385

D. Grigoriev and D. Pasechnik, Polynomial-time computing over quadratic maps i: sampling in real algebraic sets, computational complexity, vol.14, issue.1, pp.20-52, 2005.
DOI : 10.1007/s00037-005-0189-7
URL : https://hal.archives-ouvertes.fr/hal-00725128

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

D. Henrion, S. Naldi, and M. , Exact Algorithms for Linear Matrix Inequalities, SIAM Journal on Optimization, vol.26, issue.4, pp.2512-2539, 2016.
DOI : 10.1137/15M1036543
URL : https://hal.archives-ouvertes.fr/hal-01184320

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

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

G. Jeronimo, D. Perrucci, and E. Tsigaridas, On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications, SIAM Journal on Optimization, vol.23, issue.1, pp.241-255, 2013.
DOI : 10.1137/110857751
URL : https://hal.archives-ouvertes.fr/hal-00776280

G. Jeronimo and J. Sabia, Computing multihomogeneous resultants using straight-line programs, Journal of Symbolic Computation, vol.42, issue.1-2, pp.218-235, 2005.
DOI : 10.1016/j.jsc.2006.03.006

T. Krick, L. M. Pardo, and M. Sombra, Sharp estimates for the arithmetic Nullstellensatz, Duke Math. J, vol.109, pp.521-598, 2001.

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

F. and L. Gall, Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.296-303, 2014.
DOI : 10.1145/2608628.2608664

G. Lecerf, Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.209-216, 2000.
DOI : 10.1145/345542.345633
URL : https://hal.archives-ouvertes.fr/hal-00186755

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

S. Melczer and B. Salvy, Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '16, 2016.
DOI : 10.1016/j.jsc.2015.03.004
URL : https://hal.archives-ouvertes.fr/hal-01310691

A. Morgan and A. J. Sommese, A homotopy for solving general polynomial systems that respects m-homogeneous structures, Applied Mathematics and Computation, vol.24, issue.2, pp.101-113, 1987.
DOI : 10.1016/0096-3003(87)90063-4

S. Morrison, The differential ideal, pp.631-656, 1999.

D. Mumford, Algebraic Geometry I, Complex projective varieties, Classics in Mathematics, 1976.
DOI : 10.1007/978-3-642-61833-8

F. J. Rayner, An algebraically closed field, Glasgow Mathematical Journal, vol.143, issue.02, pp.146-151, 1968.
DOI : 10.1215/S0012-7094-57-02426-2

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.
DOI : 10.1007/s002000050114
URL : https://hal.archives-ouvertes.fr/inria-00098872

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 nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets, Schost. Computing parametric geometric resolutions, pp.1-48349, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00849057

I. Shafarevich, Basic Algebraic Geometry 1, 1977.

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

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

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