2000 character limit reached
An algorithm for computing Grobner basis and the complexity evaluation (1507.03217v1)
Published 12 Jul 2015 in cs.SC
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.