Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
From MaRDI portal
Publication:5119959
DOI10.1145/3087604.3087621zbMath1458.13037OpenAlexW2737200916MaRDI QIDQ5119959
Publication date: 9 September 2020
Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3087604.3087621
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (3)
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
This page was built for publication: Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
