University of Cambridge > Talks.cam > Numerical Analysis > On a Problem posed by Steve Smale

On a Problem posed by Steve Smale

Add to your list(s) Download to your calendar using vCal

  • UserFelipe Cucker (City University of Hong Kong)
  • ClockWednesday 11 May 2011, 15:00-16:00
  • HouseCMS, MR14.

If you have a question about this talk, please contact Dr Shadrin.

Please note that this talk is on Wednesday

At the request of the International Mathematical Union, in 1999, Steve Smale proposed a list of 18 problems for the mathematicians of the 21st century. The 17th of these problems asks for the existence of a deterministic algorithm computing an approximate solution of a system of $n$ complex polynomials in $n$ unknowns in time polynomial, on the average, in the size $N$ of the input system. The talk gives fundamental advances in this problem including the smoothed analysis of a randomized algorithm and a deterministic algorithm working in near-polynomial (i.e., $N^{O(\log\log N)}$) average time.

This talk is part of the Numerical Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity