Computing huge Groebner basis like cyclic10 over $\Q$ with Giac.
Résumé
We present a short description on how to fine-tune the modular algorithm implemented in the Giac computer algebra system to reconstruct huge Groebner basis over $\Q$.
The classical cyclic10 benchmark will serve as example.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...