A sparse modular GCD algorithm for polynomials over algebraic function fields

MaRDI QIDQ5301669zbMATH OpenFDO

Authors Seyed Mohammad Mahdi Javadi, Michael Monagan

Publication date 20 January 2009

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Algorithms for polynomial GCD computation over algebraic function fields
• scientific article; zbMATH DE number 2151224
• The computation of polynomial greatest common divisors over an algebraic number field
• Algorithms for the non-monic case of the sparse modular GCD algorithm
• Computing GCDs of polynomials over algebraic number fields

Cited in

(10)

• Factoring sparse polynomials fast
• Irreducibility and greatest common divisor algorithms for sparse polynomials
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• A fast parallel sparse polynomial GCD algorithm
• Algorithms for the non-monic case of the sparse modular GCD algorithm
• Algorithms for polynomial GCD computation over algebraic function fields
• The computation of polynomial greatest common divisors over an algebraic number field
• Sparse polynomial interpolation based on diversification
• The computation of polynomial greatest common divisors over an algebraic number field
• Fast separable factorization and applications

Describes a project that uses

Uses Software

• Maple

This page was built for publication: A sparse modular GCD algorithm for polynomials over algebraic function fields

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