Condition Length and Complexity for the Solution of Polynomial Systems

Smale’s 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see smale in mathematical problems for the next century, american mathematical society, providence, 2000). the main progress on smale’s problem is beltrán and pardo (found comput math 11(1):95–129, 2011) and bürgisser and cucker (ann math 174(3):1785–1836, 2011). in this paper, we will improve on both approaches and prove an interesting intermediate result on the average value of the condition number. our main results are theorem 1 on the complexity of a randomized algorithm which improves the result of beltrán and pardo (2011), theorem 2 on the average of the condition number of polynomial systems which improves the estimate found in bürgisser and cucker (2011), and theorem 3 on the complexity of finding a single zero of polynomial systems. this last theorem is similar to the main result of bürgisser and cucker (2011) but relies only on homotopy methods, thus removing the need for the elimination theory methods used in bürgisser and cucker (2011). we build on methods developed in armentano et al. (2014).