Year: 1994
Type: article
Abstract: A family of root-finding algorithms is constructed that combines knowledge of the branched covering structure of a polynomial with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that computes an $ \epsilon $-factorization of a polynomial of degree d that has an arithmetic complexity of $\mathcal{O}(d(\log d)^2 |\log \epsilon | + d^2 (\log d)^2 )$. At the present time, this complexity is the best known in terms of the degree.
Source: SIAM Journal on Computing
Authors: Myong-Hi Kim, Scott Sutherland
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2162128145