Year: 2010
Type: preprint
Abstract: This paper presents a conception for computing gröbner basis. We convert some of gröbner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem can be described by equivalent conditions, so all the above algorithms can be determined when they terminate finitely. At last, a new criterion is presented. It is an improvement for the Rewritten and Signature Criterion.
Source: arXiv (Cornell University)
Author: Huang, Lei
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1593490227