A modified LLL algorithm for change of ordering of Grobner basis

In this paper, a modified version of LLL algorithm, which is a an algorithm with output-sensitive complexity, is presented to convert a given Grobner basis with respect to a specific order of a polynomial ideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order. Also a comparison with the FGLM conversion and Buchberger method is considered.

کلیدواژه ها:

Grobner Basis ، LLL Algorithm ، Reduced Lattice Basis