Advertisement
Published in:
1996 | OriginalPaper | Chapter
Greatest common divisors of polynomials
Author : Dipl.-Ing. Dr. Franz Winkler
Published in: Polynomial Algorithms in Computer Algebra
Publisher: Springer Vienna
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
If K is a field, then K[x] is a Euclidean domain, so gcd(f, g) for f, g ∈ K[x] can be computed by the Euclidean algorithm. Often, however, we are given polynomials f, g over a domain such as ℤ or K[x1, …, xn-1] and we need to compute their gcd.