Pages that link to "Item:Q5633583"
From MaRDI portal
The following pages link to On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors (Q5633583):
Displaying 50 items.
- The computation of polynomial greatest common divisors over an algebraic number field (Q582076) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Macsyma: A personal history (Q655565) (← links)
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (Q689905) (← links)
- Spectrally degenerate graphs: hereditary case (Q713975) (← links)
- Power series remainder sequences and Padé fractions over an integral domain (Q749215) (← links)
- Bounds for resultants of univariate and bivariate polynomials (Q848582) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- On computing the intersection of a pair of algebraic surfaces (Q913442) (← links)
- Interpolating polynomials from their values (Q915342) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- Degenerate parametric curves (Q1064767) (← links)
- Solving systems of linear equations over polynomials (Q1082773) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- A p-adic approach to the computation of Gröbner bases (Q1118653) (← links)
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation (Q1124635) (← links)
- 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 (Q1124738) (← links)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- An extended polynomial GCD algorithm using Hankel matrices (Q1186699) (← links)
- Three new algorithms for multivariate polynomial GCD (Q1194336) (← links)
- Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\) (Q1205122) (← links)
- A fast method for interpolation using preconditioning (Q1214237) (← links)
- Fast modular transforms (Q1216049) (← links)
- Another polynomial homomorphism (Q1219683) (← links)
- Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130) (← links)
- A new approach to the symbolic factorization of multivariate polynomials (Q1228373) (← links)
- Primitive polynomial remainder sequences in elimination theory (Q1343108) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- The efficient calculation of powers of polynomials (Q1393926) (← links)
- Double Sylvester sums for subresultants and multi-Schur functions. (Q1394943) (← links)
- Subresultants revisited. (Q1401299) (← links)
- New structure theorem for subresultants (Q1569836) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
- On degrees of modular common divisors and the big prime gcd algorithm (Q1751453) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238) (← links)
- Congruence arithmetic algorithms for polynomial real zero determination (Q1846327) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
- A condition for multiplicity structure of univariate polynomials (Q2229732) (← links)
- On the efficiency of effective Nullstellensätze (Q2366723) (← links)
- Symmetry detection of rational space curves from their curvature and torsion (Q2409701) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
- Output-sensitive modular algorithms for polynomial matrix normal forms (Q2470057) (← links)
- Method for finding multiple roots of polynomials (Q2507024) (← links)
