An Algorithm to Check Whether a Basis of a Parametric Polynomial System is a Comprehensive Gröbner Basis and the Associated Completion Algorithm

DOI10.1145/2755996.2756676zbMath1346.13059OpenAlexW2059314720MaRDI QIDQ2819764

Yiming Yang, Deepak Kapur

Publication date: 29 September 2016

Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2755996.2756676

zbMATH Keywords

parametric polynomial systemminimal comprehensive Gröbner basisparametric S-polynomialparametric specialization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (2)

Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases

This page was built for publication: An Algorithm to Check Whether a Basis of a Parametric Polynomial System is a Comprehensive Gröbner Basis and the Associated Completion Algorithm