GVW algorithm over principal ideal domains (Q2440326): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11424-013-2130-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161736272 / rank | |||
Normal rank | |||
Revision as of 18:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | GVW algorithm over principal ideal domains |
scientific article |
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
