Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325727 | Journal of Symbolic Computation | 2011 | 13 Pages |
Abstract
This paper introduces some new concepts that place the criterion in a more general setting: S-Gröbner bases and primitive S-irreducible polynomials. We use these to propose a new, simple algorithm based on a revised F5 criterion. The new concepts also enable us to remove various restrictions, such as proving termination without the requirement that f1,â¦,fm be a regular sequence.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Alberto Arri, John Perry,