On Smale's 17th Problem: A Probabilistic Solution in Average Polynomial Time

April 17, 2007
In this talk I will discuss several conceptual aspects leading a a probabilistic positive solution to the following problem proposed by S. Smale: "Can a zero of n complex polynomial equations in n unknowns be found approximately on the average, in polynomial time with a uniform algorithm?"