An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
From MaRDI portal
Publication:5120202
DOI10.1145/3208976.3208980zbMath1467.13047OpenAlexW2808749144MaRDI QIDQ5120202
Deepak Kapur, Yao Sun, Dong Lu, Ding-Kang Wang, Michael B. Monagan
Publication date: 9 September 2020
Published in: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3208976.3208980
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (5)
An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ Algorithms for computing greatest common divisors of parametric multivariate polynomials ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Testing zero-dimensionality of varieties at a point ⋮ parametric GCD
Uses Software
This page was built for publication: An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
