Pages that link to "Item:Q2200294"
From MaRDI portal
The following pages link to Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294):
Displaying 10 items.
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238) (← links)
- Greatest common divisor of parameter-dependent polynomials (Q1898593) (← links)
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)
- Irreducibility and greatest common divisor algorithms for sparse polynomials (Q3166375) (← links)
- (Q4226976) (← links)
- On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) (← links)
- Parametric Greatest Common Divisors using Comprehensive Gröbner Systems (Q5119959) (← links)
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD (Q5120202) (← links)
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter (Q5930921) (← links)
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros (Q6087590) (← links)
