Zoltan Kovács, Bernard Parisse,
"Giac and GeoGebra ? Improved Gröbner Basis Computations"
, in Gutierrez, Jaime and Schicho, Josef and Weimann, Martin: Computer Algebra and Polynomials, Serie Lecture Notes in Computer Science, Springer International Publishing, Seite(n) 126-138, 2015, ISBN: 978-3-319-15080-2
Giac and GeoGebra ? Improved Gröbner Basis Computations
Sprache des Titels:
Computer Algebra and Polynomials
Gröbner basis on ? for revlex ordering implementation in Giac is a modular algorithm (E. Arnold). Each ?/p? computation is done via the Buchberger algorithm using F4 linear algebra technics and ?remake? speedups, they might be run in parallel for large examples. The output can be probabilistic or certified (which is much slower). Experimentation shows that the probabilistic version is faster than other open-source implementations, and about 3 times slower than the Magma implementation on one processor, it also requires less memory for big examples like Cyclic9.