D. Armentano, C. Beltrán, P. Bürgisser, F. Cucker, and M. Shub, Condition Length and Complexity for the Solution of Polynomial Systems, In: Found. Comput. Math, 2016.

W. Baur and V. Strassen, The Complexity of Partial Derivatives, In: Theor. Comput. Sci, vol.22, issue.3, pp.317-330, 1983.

C. Beltrán, A Continuation Method to Solve Polynomial Systems and Its Complexity, Numer. Math. 117, vol.1, pp.89-113, 2011.

C. Beltrán and A. Leykin, Certified Numerical Homotopy Tracking, Exp. Math. 21.1, vol.2, pp.253-295, 2012.

C. Beltrán and L. M. Pardo, Smale's 17th Problem: Average Polynomial Time to Compute Affine and Projective Solutions, In: Found. Comput. Math. 11, vol.1, issue.2, pp.95-129, 2008.

C. Beltrán and M. Shub, Complexity of Bezout's Theorem. VII. Distance Estimates in the Condition Metric, In: Found. Comput. Math, vol.9, issue.2, pp.179-195, 2009.

S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00794821

P. Bürgisser, Condition of Intersecting a Projective Variety with a Varying Linear Subspace, In: SIAM J. Appl. Algebra Geom. 1, vol.1, pp.111-125, 2000.

P. Bürgisser and F. Cucker, Condition: The Geometry of Numerical Algorithms. Grundlehren Der Mathematischen Wissenschaften 349, Ann. of Math, vol.3, issue.2, pp.1785-1836, 2011.

J. Dedieu and M. Shub, Multihomogeneous Newton Methods, Math. Comp. 69.231, pp.1071-1099, 1999.

J. W. Demmel, On Condition Numbers and the Distance to the Nearest Ill-Posed Problem, Numer. Math, vol.51, issue.3, pp.251-289, 1987.

H. Federer, Curvature Measures". In: Trans. Am. Math. Soc, vol.93, issue.3, pp.418-491, 1959.

M. Giusti, G. Lecerf, and B. Salvy, A Gröbner Free Alternative for Polynomial System Solving, J. Complexity, vol.17, pp.154-211, 2001.

J. D. Hauenstein and A. C. Liddell, Certified Predictor-Corrector Tracking for Newton Homotopies, J. Symb. Comput, vol.74, pp.239-254, 2016.

J. D. Hauenstein and F. Sottile, Algorithm 921: alphaCertified: Certifying Solutions to Polynomial Systems, ACM Trans. Math. Softw, vol.38, pp.1-20, 2012.

R. Howard, The Kinematic Formula in Riemannian Homogeneous Spaces, Mem. Amer. Math. Soc. 106, vol.509, 1993.

J. Ji, B. Kollar, and . Shiffman, A Global Lojasiewicz Inequality for Algebraic Varieties, Trans. Am. Math. Soc, vol.329, p.813, 1992.

P. Lairez, A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time, In: Found. Comput. Math. 17, vol.5, issue.2, pp.487-526, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01178588

Y. N. Lakshman, A Single Exponential Bound on the Complexity of Computing Gröbner Bases of Zero Dimensional Ideals, Effective Methods in REFERENCES Algebraic Geometry, pp.227-234, 1991.

G. Malod and N. Portier, Characterizing Valiant's Algebraic Complexity Classes, J. Complex. Computational Algebraic Geometry Workshop, vol.24, issue.1, pp.16-38, 2008.

N. Nisan, Lower Bounds for Non-Commutative Computation, Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing. STOC '91. ACM, pp.410-418, 1991.

V. Y. Pan, Univariate Polynomials: Nearly Optimal Algorithms for Factorization and Rootfinding, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation. ISSAC '01. ACM, pp.253-267, 2001.

V. Pan, Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros, Comput. Math. Appl. 31, vol.12, pp.97-138, 1996.

J. Renegar, On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials, J. Complex, vol.18, issue.2, pp.350-370, 1987.

W. Rudin, Function theory in the unit ball of C n . Grundlehren der Mathematischen Wissenschaften 241, 1980.

M. Rump and S. Graillat, Verified Error Bounds for Multiple Roots of Systems of Nonlinear Equations, Numer. Algorithms, vol.54, pp.359-377, 2010.

M. Shub, Complexity of Bezout's Theorem. VI, Geodesics in the Condition (Number) Metric". In: Found. Comput. Math, vol.9, issue.2, pp.171-178, 2009.

M. Shub and S. Smale, Complexity of Bezout's Theorem. II. Volumes and Probabilities, Computational Algebraic Geometry, vol.109, pp.267-285, 1992.

, Complexity of Bézout's Theorem. I. Geometric Aspects, Complexity of Bezout's Theorem. III. Condition Number and Packing, vol.9, pp.128-148, 1993.

S. Smale, Newton's Method Estimates from Data at One Point, The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, pp.185-196, 1985.

, Mathematical Problems for the next Century, Acta Numer, vol.6, pp.7-15, 1997.

S. Telen, M. V. Barel, and J. Verschelde, A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation, 2020.

S. Timme, Mixed Precision Path Tracking for Polynomial Homotopy Continuation, 2020.

S. Toda, Classes of Arithmetic Circuits Capturing the Complexity of Computing the Determinant, IEICE Trans. Inf. Syst. E75-D, vol.1, pp.116-124, 1992.

L. G. Valiant, Reducibility by Algebraic Projections, Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing. STOC '79. ACM, vol.30, pp.365-380, 1979.