@Article{JCM-3-2,
author = {},
title = {The Computational Complexity of the Resultant Method for Solving Polynomial Equations},
journal = {Journal of Computational Mathematics},
year = {1985},
volume = {3},
number = {2},
pages = {161--166},
abstract = {<p style="text-align: justify;">Under an assumption of distribution on zeros of the polynomials, we have given the estimate of computational cost for the resultant method. The result in that, in probability $1-\mu$, the computational cost of the resultant method for finding $ε$-approximations of all zeros is at most $$cd^2(log d+log\frac{1}{\mu}+loglog\frac{1}ε)$$, where the cost is measured by the number of f-evaluations. The estimate of cost can be decreased to $c(d^2logd+d^2log\frac{1}{\mu}+dloglog\frac{1}ε)$ by combining resultant method with parallel quasi-Newton method.</p>},
issn = {1991-7139},
doi = {https://doi.org/1985-JCM-9613},
url = {https://global-sci.com/article/86240/the-computational-complexity-of-the-resultant-method-for-solving-polynomial-equations}
}