2000 character limit reached
An algorithm for computing Grobner basis and the complexity evaluation
Published 12 Jul 2015 in cs.SC | (1507.03217v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
