A sparse modular GCD algorithm for polynomials over algebraic function fields

zbMATH Open1190.68090MaRDI QIDQ5301669FDOQ5301669

Authors: Seyed Mohammad Mahdi Javadi, Michael Monagan 

Publication date: 20 January 2009

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (9)

• 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
• The computation of polynomial greatest common divisors over an algebraic number field
• Sparse polynomial interpolation based on diversification
• Fast separable factorization and applications

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)