Computing Comprehensive Grobner Systems: A Comparison of Two Methods
In this paper, we consider two main approaches to compute Gr\"obner bases for parametric polynomial ideals, namely the {\sc DisPGB} algorithm developed by Montes \cite{monts1} and the {\sc PGBMain} proposed by Kapur, Sun and Wang \cite{kapur}. The former algorithm creates new branches in the s...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2017-12-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v25-n3/v25-n2-(pp278-302).pdf |