An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm (Q2819764)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm |
scientific article; zbMATH DE number 6631269
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm |
scientific article; zbMATH DE number 6631269 |
Statements
29 September 2016
0 references
minimal comprehensive Gröbner basis
0 references
parametric polynomial system
0 references
parametric S-polynomial
0 references
parametric specialization
0 references
An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm (English)
0 references
