Algorithms for polynomial GCD computation over algebraic function fields

DOI10.1145/1005285.1005328zbMath1134.12305OpenAlexW2006749409MaRDI QIDQ4657339

Mark van Hoeij, Michael B. 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

Mathematics Subject Classification ID

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

Related Items (2)

Computing sparse GCD of multivariate polynomials via polynomial interpolation ⋮ 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