Related papers: On finding complex roots of polynomials using the …
This paper has been withdrawn by the authors due to a crucial gap in the estimates for m>=4.
This paper has been withdrawn by the author.
This paper has been withdrawn by the author, due an error in claim 1.
This paper has been withdrawn by the authors, since it has been merged with Part I (ID 0802.3570)
This paper has been withdrawn by the authors due to some fatal errors in the analysis.
We present a practical implementation based on Newton's method to find all roots of several families of complex polynomials of degrees exceeding one billion ($10^9$) so that the observed complexity to find all roots is between $O(d\ln d)$…
This article has been withdrawn due to an error in a proof of the main result.
This paper has been withdrawn by the authors, due to issues concerning the use of unpublished experimental data.
The paper has been withdrawn by the authors
This paper has been withdrawn.
This paper has been withdrawn by the author due to a crucial error in the formulation.
We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…
This paper has been withdrawn by the author.
This paper has been withdrawn due to a crucial error in the proof of the main theorem
We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…
This paper has been withdrawn by the authors
This paper has been withdrawn by the author due to that the main results and approaches are closedly parallel to the ones in Lie algebra case.
This article has been withdrawn.
This paper has been withdrawn by the author(s), due to the existence of a much better paper in http://arxiv.org/abs/cs.CR/0207027
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…