Condition length and complexity for the solution of polynomial systems (Q506608): Difference between revisions

Smale's 17th problem is on existence of an algorithm which finds an approximate zero of a polynomial system in average polynomial time. In this paper an intermediate result on the average value of the condition number is proved. The new achievements are on: the complexity of a randomized algorithm, the average of the condition number of polynomial systems, the complexity of finding a single zero of polynomial systems.