An algorithm for computing Grobner basis and the complexity evaluation

Abstract

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.