On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Cited in

(73)

A subdivision method for computing nearest gcd with certification
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
Systems of rational polynomial equations have polynomial size approximate zeros on the average
Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
Fast differential eleminination in C: The CDiffElim environment
Fraction-free computation of the unit-circle resultant with any singularity profile
The efficient calculation of powers of polynomials
Blind image deconvolution via Hankel based method for computing the GCD of polynomials
A condition for multiplicity structure of univariate polynomials
Computing sparse GCD of multivariate polynomials via polynomial interpolation
New structure theorem for subresultants
Spectrally degenerate graphs: hereditary case
Hensel lifting and bivariate polynomial factorisation over finite fields
On the complexity of the Lickteig-Roy subresultant algorithm
Fast modular transforms
Power series remainder sequences and Padé fractions over an integral domain
An extended polynomial GCD algorithm using Hankel matrices
On degrees of modular common divisors and the big prime gcd algorithm
A fast parallel sparse polynomial GCD algorithm
A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials
A New Black Box Factorization Algorithm - the Non-monic Case
Sylvester-Habicht sequences and fast Cauchy index computation
Factoring multivariate polynomials via partial differential equations
Factoring Multivariate Polynomials Over the Integers
Spécialisation de la suite de Sturm et sous-résultants (I)
Double Sylvester sums for subresultants and multi-Schur functions.
Computing the polynomial remainder sequence via Bézout matrices
Interpolating polynomials from their values
A new method for computing polynomial greatest common divisors and polynomial remainder sequences
\textsc{Rings}: an efficient Java/Scala library for polynomial rings
Certified approximate univariate GCDs
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
Bounds for resultants of univariate and bivariate polynomials
Symmetry detection of rational space curves from their curvature and torsion
A fast method for interpolation using preconditioning
Degenerate parametric curves
Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
Subresultants revisited.
On the efficiency of effective Nullstellensätze
A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
Solving systems of linear equations over polynomials
Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
Analysis of Euclidean algorithms for polynomials over finite fields
Computational aspects of deciding if all roots of a polynomial lie within the unit circle
SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
Two-dimensional Hankel theory
Computer algebra: Past and future
Macsyma: A personal history
Methodologies of Symbolic Computation
Method for finding multiple roots of polynomials
An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
Primitive polynomial remainder sequences in elimination theory
The ERES method for computing the approximate GCD of several polynomials
On the structure of Clifford quantum cellular automata
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
On computing the intersection of a pair of algebraic surfaces
Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
An optimal fraction free Routh array†
The computation of polynomial greatest common divisors over an algebraic number field
Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\)
A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)
Output-sensitive modular algorithms for polynomial matrix normal forms
Three new algorithms for multivariate polynomial GCD
Algorithms for computing greatest common divisors of parametric multivariate polynomials
Another polynomial homomorphism
A fraction free matrix Berlekamp/Massey algorithm
Congruence arithmetic algorithms for polynomial real zero determination
A fraction-free unit-circle zero location test for a polynomial with any singularity profile
A new approach to the symbolic factorization of multivariate polynomials
A p-adic approach to the computation of Gröbner bases

This page was built for publication: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633583)