×

Defects and revisions of an asymptotically fast algorithm for polynomial GCD’s. (English) Zbl 0618.65013

A revision of an asymptotically fast algorithm for polynomial greatest common divisors (GCD’s) is given.
Reviewer: P.Reichensperger

MSC:

65D99 Numerical approximation and computational geometry (primarily algorithms)
65Yxx Computer aspects of numerical algorithms
12D05 Polynomials in real and complex fields: factorization
65H05 Numerical computation of solutions to single equations
PDFBibTeX XMLCite