Canonical Comprehensive Gröbner Bases (2002)
| Venue: | Journal of Symbolic Computation |
| Citations: | 129 - 4 self |
BibTeX
@ARTICLE{Weispfenning02canonicalcomprehensive,
author = {Volker Weispfenning},
title = {Canonical Comprehensive Gröbner Bases},
journal = {Journal of Symbolic Computation},
year = {2002},
volume = {14},
pages = {1--29}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Comprehensive Gröbner bases for parametric polynomial ideals were introduced, constructed, and studied by the author in 1992. Since then the construction has been implemented in the computer algebra systems aldes/sac-2, mas, reduce and maple. A comprehensive Gröbner basis is a finite subset G of a parametric polynomial ideal I such that σ(G) constitutes a Gröbner basis of the ideal generated by σ(I) under all specializations σ of the parameters in arbitrary fields. Thos concept has found numerous...
