Foundations of Computational Mathematics

, Volume 8, Issue 1, pp 1–43

On Smale's 17th Problem: A Probabilistic Positive Solution


DOI: 10.1007/s10208-005-0211-0

Cite this article as:
Beltran, C. & Pardo, L. Found Comput Math (2008) 8: 1. doi:10.1007/s10208-005-0211-0


Smale's 17th Problem asks “Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the space of inputs], in polynomial time with a uniform algorithm?” We present a uniform probabilistic algorithm for this problem and prove that its complexity is polynomial. We thus obtain a partial positive solution to Smale's 17th Problem.

Copyright information

© Society for Foundations of Computational Mathematics 2007

Authors and Affiliations

  1. 1.Departamento de Matematicas, Estadistica y Computacion, F. de Ciencias, University of CantabriaE-39071 SantanderSpain

Personalised recommendations