Papers
Topics
Authors
Recent
Search
2000 character limit reached

Signature-Based Gröbner Basis Algorithms --- Extended MMM Algorithm for computing Gröbner bases

Published 11 Aug 2013 in cs.SC | (1308.2371v1)

Abstract: Signature-based algorithms is a popular kind of algorithms for computing Gr\"obner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a view of signature-based algorithms is given, that is, signature-based algorithms can be regarded as an extended version of the famous MMM algorithm. By this view, this paper aims to give an easier way to understand signature-based Gr\"obner basis algorithms.

Citations (3)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.