%0 Conference Proceedings %T Changing the ordering of Grobner Bases with LLL: Case of Two Variables %+ Solving problems through algebraic computation and efficient software (SPACES) %A Basiri, Ali %A Faugère, Jean-Charles %Z Colloque avec actes et comité de lecture. internationale. %< avec comité de lecture %Z A03-R-495 || basiri03a %B International Symposium on Symbolic and Algebraic Computation - ISSAC 03 %C Philadelphie, USA %Y Hoon Hong %I ACM Press %P 23-29 %8 2003 %D 2003 %K grobner basis %K lll %K reduced lattice basis %K base reduire %K complexite %K complexity %K bases de grobner %Z Computer Science [cs]/Other [cs.OH]Conference papers %X 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. %G English %L inria-00099732 %U https://inria.hal.science/inria-00099732 %~ CNRS %~ INRIA %~ INPL %~ INRIA-LORRAINE %~ LORIA2 %~ INRIA-NANCY-GRAND-EST %~ TESTALAIN1 %~ UNIV-LORRAINE %~ INRIA2 %~ LORIA