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