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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.