Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,324 papers from all fields of science
Search
Sign In
Create Free Account
Polynomial greatest common divisor
Known as:
Greatest common divisor of two polynomials
, Euclidean division of polynomials
, GCD
Expand
In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Computer algebra system
Euclidean algorithm
Extended Euclidean algorithm
Factorization of polynomials
Expand
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
A. Polishchuk
Journal of the Institute of Mathematics of…
2015
Corpus ID: 54895417
In this paper, for each $n\geqslant g\geqslant 0$ we consider the moduli stack $\widetilde{{\mathcal{U}}}_{g,n}^{ns}$ of curves…
Expand
2009
2009
Computations modulo regular chains
Xin Li
,
M. M. Maza
,
Wei Pan
International Symposium on Symbolic and Algebraic…
2009
Corpus ID: 14666322
The computation of triangular decompositions involve two fundamental operations: polynomial GCDs modulo regular chains and…
Expand
2007
2007
A fast algorithm for solving the Sylvester structured total least squares problem
Bingyu Li
,
Zhuojun Liu
,
L. Zhi
Signal Processing
2007
Corpus ID: 7405895
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…
Expand
2004
2004
Two Resultant Based Methods Computing the Greatest Common Divisor of Two Polynomials
D. Triantafyllou
,
M. Mitrouli
Numerical Analysis and Its Applications
2004
Corpus ID: 37969384
In this paper we develop two resultant based methods for the computation of the Greatest Common Divisor (GCD) of two polynomials…
Expand
Highly Cited
2000
Highly Cited
2000
QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
C. Zarowski
,
Xiaoyan Ma
,
F. Fairman
IEEE Transactions on Signal Processing
2000
Corpus ID: 13175921
This paper presents a novel means of computing the greatest common divisor (GCD) of two polynomials with real-valued coefficients…
Expand
Review
1995
Review
1995
Mijajlović: On Kurepa problems in number theory
Z. Mijajlovic
1995
Corpus ID: 17023276
We discuss some problems in number theory posed by-Duro Kurepa, including the so-called left factorial hypothesis that an odd…
Expand
1995
1995
Parallel integral multivariate polynomial greatest common divisor computation
M. O. Rayes
1995
Corpus ID: 57455295
All of the existing computer algebra systems are sequential. The underlying algorithms were written in sequential code regardless…
Expand
1995
1995
On computing greatest common divisors with polynomials given by black boxes for their evaluations
Angel Díaz
,
E. Kaltofen
International Symposium on Symbolic and Algebraic…
1995
Corpus ID: 8521388
The black box representation of a multivariate polynomial is a function that takes as input a value for each variable and then…
Expand
1974
1974
Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms
A. Miola
,
D. Yun
SIGS
1974
Corpus ID: 15883647
Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. The regular linear…
Expand
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)
ACCEPT & CONTINUE