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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper, for each $n\geqslant g\geqslant 0$ we consider the moduli stack $\widetilde{{\mathcal{U}}}_{g,n}^{ns}$ of curves… 
2009
2009
The computation of triangular decompositions involve two fundamental operations: polynomial GCDs modulo regular chains and… 
2005
2005
  • S. Contini
  • 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
In this paper we develop two resultant based methods for the computation of the Greatest Common Divisor (GCD) of two polynomials… 
Highly Cited
2000
Highly Cited
2000
This paper presents a novel means of computing the greatest common divisor (GCD) of two polynomials with real-valued coefficients… 
Review
1995
Review
1995
We discuss some problems in number theory posed by-Duro Kurepa, including the so-called left factorial hypothesis that an odd… 
1995
1995
All of the existing computer algebra systems are sequential. The underlying algorithms were written in sequential code regardless… 
1995
1995
The black box representation of a multivariate polynomial is a function that takes as input a value for each variable and then… 
1974
1974
Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. The regular linear…