# Computing huge Groebner basis like cyclic10 over $\Q$ with Giac

## TL;DR

This paper discusses optimizing the modular algorithm in Giac to compute large Groebner bases over rationals, demonstrated using the cyclic10 benchmark.

## Contribution

It introduces specific fine-tuning techniques for the modular algorithm in Giac to efficiently compute large Groebner bases over .

## Key findings

- Successful computation of the cyclic10 benchmark
- Enhanced efficiency in Groebner basis reconstruction
- Practical guidelines for algorithm tuning

## Abstract

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.