The computation of polynomial greatest common divisors over an algebraic number field

Lars Langemyr*, Scott McCallum

*Corresponding author for this work

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

We present a modular algorithm for computing the greatest common divisor of two polynomials over an algebraic number field. Our algorithm is an application of ideas of Brown and Collins. We use the Weinberger-Rothschild homomorphic scheme with the important change that we avoid factoring the modular image of the minimal polynomial. We perform a computing time analysis and report some empirical computing times.

Original languageEnglish
Pages (from-to)429-448
Number of pages20
JournalJournal of Symbolic Computation
Volume8
Issue number5
DOIs
Publication statusPublished - 1 Jan 1989
Externally publishedYes

Fingerprint Dive into the research topics of 'The computation of polynomial greatest common divisors over an algebraic number field'. Together they form a unique fingerprint.

Cite this