scientific article; zbMATH DE number 1303539

MaRDI QIDQ4250163zbMATH OpenFDO

Authors Roger Margot, Michael Monagan

Publication date 18 May 2000

zbMATH Keywords

Mapleunivariate polynomial GCD computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic number theory computations (11Y40)

Recommendations

• Computing GCDs of polynomials over algebraic number fields
• Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
• The computation of polynomial greatest common divisors over an algebraic number field
• The computation of polynomial greatest common divisors over an algebraic number field
• scientific article; zbMATH DE number 1263394
• Computation of unirational fields
• Algorithms for polynomial GCD computation over algebraic function fields
• scientific article; zbMATH DE number 953021
• On approximate GCDs of univariate polynomials
• On computation of the greatest common divisor of several polynomials over a finite field.

Cited in

(6)

• Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
• In-place arithmetic for univariate polynomials over an algebraic number field
• Computing GCDs of polynomials over algebraic number fields
• On degrees of modular common divisors and the big prime gcd algorithm
• On the design and implementation of Brown's algorithm over the integers and number fields
• On computing polynomial GCDs in alternate bases

Describes a project that uses

Uses Software

• Maple

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250163)