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.
2015
2015
MODULI OF CURVES WITH NONSPECIAL DIVISORS AND RELATIVE MODULI OF $A_{\infty }$ -STRUCTURES
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
Computations modulo regular chains
The computation of triangular decompositions involve two fundamental operations: polynomial GCDs modulo regular chains and… 
2007
2007
A fast algorithm for solving the Sylvester structured total least squares problem
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
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… 
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… 
Review
1995
Review
1995
Mijajlović: On Kurepa problems in number theory
We discuss some problems in number theory posed by-Duro Kurepa, including the so-called left factorial hypothesis that an odd… 
1995
1995
Parallel integral multivariate polynomial greatest common divisor computation
All of the existing computer algebra systems are sequential. The underlying algorithms were written in sequential code regardless… 
1995
1995
On computing greatest common divisors with polynomials given by black boxes for their evaluations
The black box representation of a multivariate polynomial is a function that takes as input a value for each variable and then… 
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… 
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)