inria-00071841, version 1
Changing the ordering of Gröbner Bases with LLL: Case of Two Variables
N° RR-4746 (2003)
Résumé : We present an algorithm for the transformation of a Gröbner basis of an ideal with respect to any given ordering into a Gröbner basis with respect to any other ordering. This algorithm is based on a modified version of the LLL algorithm. The worst case theoretical complexity of this algorithm is not better than the complexity of the FGLM algorithm; but can also give the theoretical complexity with some parameters depending on the size of the output. When the output is small then algorithm is more efficient. We also present a first implementation of the algorithm in Maple. This algorithm is restricted to the case of two variables but works also in positive dimension.
- 1 :
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- 2 :
- CNRS : UMR7606 – Université Pierre et Marie Curie (UPMC) - Paris VI
- Domaine : Informatique/Autre
- Mots-clés : GRÖBNER BASIS / LLL / REDUCED LATTICE BASIS / COMPLEXITY
- Référence interne : RR-4746
- inria-00071841, version 1
- http://hal.inria.fr/inria-00071841
- oai:hal.inria.fr:inria-00071841
- Contributeur :
- Soumis le : Mardi 23 Mai 2006, 18:56:21
- Dernière modification le : Vendredi 7 Juillet 2006, 16:12:48

Documents associés

Exporter