Pages that link to "Item:Q5120202"
From MaRDI portal
The following pages link to An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD (Q5120202):
Displaying 9 items.
- parametric GCD (Q46743) (← links)
- An extended polynomial GCD algorithm using Hankel matrices (Q1186699) (← links)
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases (Q1730311) (← links)
- Testing zero-dimensionality of varieties at a point (Q2035627) (← links)
- Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)
- Approximate GCD of multivariate polynomials (Q2725944) (← links)
- A subresultant based subspace method for the computation of polynomial GCDs (Q2819622) (← links)
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm (Q2819632) (← links)
