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.
2016
2016
On topological filtration for Severi-Brauer varieties II N
The topological filtration on K ′ 0 of a Severi-Brauer variety is computed if the quotient of its index and exponent is a… 
2013
2013
An Efficient Somewhat HE scheme over Integers and Its Variation
In 2010, Dijk et al. demonstrated a simple somewhat homomorphic encryption (HE) scheme over the integers of which this simplicity… 
2009
2009
Birational Geometry of Algebraic Varieties with a Pencil of Fano Cyclic Covers
We prove birational rigidity of fiber spaces π:V → P1, the fiber of which is a Fano cyclic cover of index 1, provided it is… 
2009
2009
Some constraints on the existence of a perfect cuboid
The existence or otherwise of a perfect cuboid is a problem known since at least the time of Euler. This paper uses only the most… 
2008
2008
Note-event Detection in Polyphonic Musical Signals based on Harmonic Matching Pursuit and Spectral Smoothness
Abstract Harmonic Matching Pursuit (HMP) is an interesting signal processing tool to detect simultaneous notes in musical audio… 
1996
1996
Greatest common divisors of polynomials
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… 
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… 
1988
1988
A new method for computing polynomial greates common divisors and polynomial remainder sequences
SummaryA new method is presented for the computation of a greatest common divisor (gcd) of two polynomials, along with their… 
1975
1975
A notation for the GCD and LCM functions
This paper proposes a notation to be used for the greatest common divisor (gcd) and least common multiple (1cm) functions in APL… 
1952
1952
An extension of renewal theory
Renewal theory can be and has been viewed in several different ways. One way is to reduce the problems to those concerning 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)