Pages that link to "Item:Q1194336"
From MaRDI portal
The following pages link to Three new algorithms for multivariate polynomial GCD (Q1194336):
Displayed 8 items.
- Algebraic-trigonometric Pythagorean-hodograph curves and their use for Hermite interpolation (Q489769) (← links)
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (Q689905) (← links)
- Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries (Q1325135) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
- An improved EZ-GCD algorithm for multivariate polynomials (Q2518611) (← links)
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)