An algorithm for computing Grobner basis and the complexity evaluation
Symbolic Computation
2015-07-14 v1
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.
Cite
@article{arxiv.1507.03217,
title = {An algorithm for computing Grobner basis and the complexity evaluation},
author = {Yong-Jin Kim and Hyon-Song Paek and Nam-Chol Kim and Chong-Il Byon},
journal= {arXiv preprint arXiv:1507.03217},
year = {2015}
}