Skip to search formSkip to main contentSkip to account menu

Polynomial greatest common divisor

Known as: Greatest common divisor of two polynomials, Euclidean division of polynomials, GCD 
In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Computer algebra systemEuclidean algorithmExtended Euclidean algorithmFactorization of polynomials

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
We consider the problem of computing minimal real or complex deformations to the coefficients in a list of relatively prime real… 
Highly Cited
2006
Highly Cited
2006
Some Facinating Properties of Balancing Numbers
This is authors version postprint. Copyright for the published version belongs to publishers 
2005
2005
Greatest Common Divisor
  • S. Contini
  • Encyclopedia of Cryptography and Security
  • 2005
  • Corpus ID: 12661002
In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf… 
2004
2004
Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
The main purpose of this article is to present algorithms to parameterize the degree of the greatest common divisor of two… 
2004
2004
Two Resultant Based Methods Computing the Greatest Common Divisor of Two Polynomials
In this paper we develop two resultant based methods for the computation of the Greatest Common Divisor (GCD) of two polynomials… 
2002
2002
Barnett's Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices
This article provides a new presentation of Barnett?s theorems giving the degree (resp. coefficients) of the greatest common… 
Highly Cited
2000
Highly Cited
2000
QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
This paper presents a novel means of computing the greatest common divisor (GCD) of two polynomials with real-valued coefficients… 
Highly Cited
1990
Highly Cited
1990
Interpolating Polynomials from Their Values
1974
1974
Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms
Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. The regular linear… 
Highly Cited
1971
Highly Cited
1971
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
This paper examines the computation of polynomial greatest common divisors by various generalizations of Euclid's algorithm. The… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)