scientific article; zbMATH DE number 1263314
From MaRDI portal
Publication:4234189
Recommendations
- Greatest common divisor of parameter-dependent polynomials
- Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
- scientific article; zbMATH DE number 2242535
- Parametric Euclidean algorithm
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
Cited in
(14)- A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.
- On a problem of Berzsenyi regarding the \(\gcd\) of polynomial expressions
- Greatest common divisor of parameter-dependent polynomials
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- scientific article; zbMATH DE number 6520834 (Why is no real title available?)
- Computing the shapes arising in a family of space rational curves depending on one parameter
- On the Greatest Common Divisor of the Value of Two Polynomials
- Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
- scientific article; zbMATH DE number 2242535 (Why is no real title available?)
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter
- Subresultant of Bernstein polynomials and its application in computing the parametric greatest common divisor
- An algorithm for computing greatest common right divisors of parametric Ore polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234189)
