D. Armentano, C. Beltrán, P. Bürgisser, F. Cucker, and M. Shub, Condition Length and Complexity for the Solution of Polynomial Systems, Foundations of Computational Mathematics, 2016.

, A Stable, Polynomial-Time Algorithm for the Eigenpair Problem, Journal of the European Mathematical Society, vol.20, pp.1375-1437, 2018.

D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler, Numerically Solving Polynomial Systems with Bertini, Software, Environments, and Tools, vol.25, 2013.

W. Baur and V. Strassen, The Complexity of Partial Derivatives, Theoretical Computer Science, vol.22, pp.317-330, 1983.

C. Beltrán, A Continuation Method to Solve Polynomial Systems and Its Complexity, Numerische Mathematik 117.1, pp.89-113, 2011.

C. Beltrán and L. M. Pardo, On Smale's 17th Problem: A Probabilistic Positive Solution, Foundations of Computational Mathematics 8.1, pp.1-43, 2008.

, Efficient Polynomial System-Solving by, Numerical Methods". In: Journal of Fixed Point Theory and Applications, vol.6, pp.63-85, 2009.

, Smale's 17th Problem: Average Polynomial Time to Compute Affine and Projective Solutions, Journal of the American Mathematical Society, vol.22, pp.363-385, 2009.

, Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems, Foundations of Computational Mathematics, vol.11, issue.1, pp.95-129, 2011.

C. Beltrán and M. Shub, Complexity of Bezout's Theorem. VII. Distance Estimates in the Condition Metric, Foundations of Computational Mathematics 9, pp.179-195, 2009.

L. Blum, M. Shub, and S. Smale, On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines, Bulletin of the American Mathematical Society. N.S. 21, vol.1, pp.1-46, 1989.

A. Bostan, Algorithmes Efficaces En Calcul Formel, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01431717

P. Breiding and N. Vannieuwenhoven, The Condition Number of Join Decompositions, SIAM Journal on Matrix Analysis and Applications, vol.39, issue.1, pp.287-309, 2018.

I. Briquel, F. Cucker, J. Peña, and V. Roshchina, Fast Computation of Zeros of Polynomial Systems with Bounded Degree under Finite-Precision, Mathematics of Computation 83, vol.287, pp.1279-1317, 2014.

P. Bürgisser and F. Cucker, Condition: The Geometry of Numerical Algorithms, Grundlehren Der Mathematischen Wissenschaften, vol.174, pp.1785-1836, 2011.

P. Bürgisser and A. Lerario, Probabilistic Schubert Calculus, Journal für die reine und angewandte Mathematik, 2018.

J. Dedieu, Points Fixes, Zéros et La Méthode de Newton, Mathématiques & Applications. Springer, vol.54, 2006.

J. Dedieu, G. Malajovich, and M. Shub, Adaptive Step-Size Selection for Homotopy Methods to Solve Polynomial Equations, IMA Journal of Numerical Analysis, vol.33, pp.1-29, 2013.

J. W. Demmel, The Probability That a Numerical Analysis Problem Is Difficult, Mathematics of Computation 50, vol.182, pp.449-480, 1988.

A. Edelman, Eigenvalues and Condition Numbers of Random Matrices, 1989.

H. Federer, Curvature Measures". In: Transactions of the American Mathematical Society, vol.93, pp.418-491, 1959.

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 1999.

J. D. Hauenstein and A. C. Liddell, Certified Predictor-Corrector Tracking for Newton Homotopies, Journal of Symbolic Computation, vol.74, pp.239-254, 2016.

J. D. Hauenstein and F. Sottile, Algorithm 921: alphaCertified: Certifying Solutions to Polynomial Systems, ACM Transactions on Mathematical Software, vol.38, pp.1-20, 2012.

C. J. Hillar and L. Lim, Most Tensor Problems Are NP-Hard, Journal of the ACM 60, pp.1-39, 2013.

A. S. Householder, Unitary Triangularization of a Nonsymmetric Matrix, Journal of the ACM, vol.5, pp.339-342, 1958.
URL : https://hal.archives-ouvertes.fr/hal-01316095

R. Howard, The Kinematic Formula in Riemannian Homogeneous Spaces, Memoirs of the, 1993.

W. Kahan, Accurate Eigenvalues of a Symmetric Tri-Diagonal Matrix, 1966.

P. Lairez, A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time, Foundations of Computational Mathematics, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01178588

G. Malajovich, On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis, Theoretical Computer Science 133.1, pp.65-84, 1994.

, Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric, Foundations of Computational Mathematics, 2018.

J. Renegar, On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials, In: Mathematics of Operations Research, vol.12, issue.1, pp.350-370, 1987.

M. Shub, On the Distance to the Zero Set of a Homogeneous Polynomial, In: Journal of Complexity, vol.5, pp.90027-90034, 1989.

, Some Remarks on Bezout's Theorem and Complexity Theory, From Topology to Computation: Proceedings of the Smalefest, pp.443-455, 1993.

, Complexity of Bezout's Theorem. VI, Geodesics in the Condition (Number) Metric". In: Foundations of Computational Mathematics 9, pp.171-178, 2009.

M. Shub and S. Smale, Complexity of Bézout's Theorem. I. Geometric Aspects, Journal of the American Mathematical Society, vol.6, pp.459-501, 1993.

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

, Complexity of Bezout's Theorem. V. Polynomial Time, Theoretical Computer Science 133.1. Selected papers of the Workshop on Continuous Algorithms and Complexity, vol.9, pp.90122-90130, 1993.

, Complexity of Bezout's Theorem. IV. Probability of Success, 1996.

, SIAM Journal on Numerical Analysis, vol.33, pp.128-148

. Smale, On the Efficiency of Algorithms of Analysis, Bulletin of The, vol.13, pp.87-121, 1985.

, Newton's Method Estimates from Data at One Point, The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, vol.20, pp.7-15, 1985.

. Inria-saclay-Île-de-france, , 91120.