Abstract

In this paper, a modied 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 specic 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.