GVW algorithm over principal ideal domains (Q2440326)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: GVW algorithm over principal ideal domains |
scientific article; zbMATH DE number 6270881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | GVW algorithm over principal ideal domains |
scientific article; zbMATH DE number 6270881 |
Statements
GVW algorithm over principal ideal domains (English)
0 references
18 March 2014
0 references
The GVW algorithm, given by Gao, Wang, and Volny, for computing a Gröbner basis for an ideal in a polynomial ring, is known to be much faster and simpler than the algorithm F5. In this paper, the authors generalize the GVW algorithm and present an algorithm to compute a Gröbner basis for ideals when the coefficient ring is a principal ideal domain.
0 references
Buchberger's algorithm
0 references
F5 algorithm
0 references
Gröbner basis
0 references
GVW algorithm
0 references
principal ideal domain
0 references
0 references
0 references
0.8310145735740662
0 references
0.8105142712593079
0 references
0.803959310054779
0 references
0.8024845719337463
0 references
