@Article{JCM-2-2,
author = {},
title = {The Cost of Kuhn's Algorithm and Complexity Theory},
journal = {Journal of Computational Mathematics},
year = {1984},
volume = {2},
number = {2},
pages = {152--163},
abstract = {<p style="text-align: justify;">A comparison by Wang and Xu between S. Samle&#39;s cost estimation for Newton&#39;s method and that of the author&#39;s for Kuhn&#39;s algorithm, both aiming at the zero finding of complex polynomials, showed improvements the advantage of the latter in finding zeros and approximate zeros. In this paper, important on the above work are made. Furthermore, a probabilistic estimation of the monotonicity of Kuhn&#39;s algorithm is obtained.</p>},
issn = {1991-7139},
doi = {https://doi.org/1984-JCM-9649},
url = {https://global-sci.com/article/86271/the-cost-of-kuhns-algorithm-and-complexity-theory}
}