An algorithm for computing Grobner basis and the complexity evaluation
classification
💻 cs.SC
keywords
algorithmcomplexitycomputinggrobnerbasesbasiscomparecompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.