Computation complexity of the euler algorithms for the roots of complex polynomials

Authors:
Myong-Hi Kim
Affiliations:
-
Venue:
Computation complexity of the euler algorithms for the roots of complex polynomials
Year:
1986

Citing 0
Cited 3

Newton's method for analytic systems of equations with constant rank derivatives

Journal of Complexity
Robust approximate zeros

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Root-refining for a polynomial equation

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract