Algorithms for polynomial GCD computation over algebraic function fields

DOI10.1145/1005285.1005328zbMATH Open1134.12305OpenAlexW2006749409MaRDI QIDQ4657339FDOQ4657339

Authors: Mark van Hoeij, Michael Monagan 

Publication date: 14 March 2005

Published in: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.7037

Recommendations

• Computing GCDs of polynomials over algebraic number fields
• scientific article; zbMATH DE number 1263394
• A sparse modular GCD algorithm for polynomials 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
• Circuits for computing the GCD of two polynomials over an algebraic number field
• scientific article; zbMATH DE number 17841
• Polynomial factorization algorithms over number fields
• scientific article; zbMATH DE number 1594303
• Algorithms for Function Fields

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Computing GCDs of polynomials over algebraic number fields
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• On computation of the greatest common divisor of several polynomials over a finite field.
• A sparse modular GCD algorithm for polynomials over algebraic function fields
• Basic algorithms for rational function fields
• Reduction of 2-D rational functions
• An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
• The computation of polynomial greatest common divisors over an algebraic number field
• An efficient algorithm for factoring polynomials over algebraic extension field

Uses Software

• Maple

This page was built for publication: Algorithms for polynomial GCD computation over algebraic function fields

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