论文部分内容阅读
<正> According to S. Smale, an algorithm is said to be tractable if its cost of finding a zero of a complex polynomial does not grow exponentially with the degree of polynomials. Smale proved that for the case all |c_k|<1, the cost of Newton’s met