Algorithmische Aspekte zur Theorie der Gröbner-Basen. (Algorithmic aspects of the theory of Gröbner bases) (Q1262347)
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: Algorithmische Aspekte zur Theorie der Gröbner-Basen. (Algorithmic aspects of the theory of Gröbner bases) |
scientific article; zbMATH DE number 4123852
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmische Aspekte zur Theorie der Gröbner-Basen. (Algorithmic aspects of the theory of Gröbner bases) |
scientific article; zbMATH DE number 4123852 |
Statements
Algorithmische Aspekte zur Theorie der Gröbner-Basen. (Algorithmic aspects of the theory of Gröbner bases) (English)
0 references
1988
0 references
After presenting basic facts about Gröbner basis theory (e.g. definitions of Gröbner bases, S-polynomials,...), a shortened version of Buchberger's algorithm is presented, depending on four criterions (F(irst already exists), M(ultiple), B(ackward investigation), R(edundance)). A transformation of the Möller-Gebauer algorithm to modules of syzygies is described, which helps to shorten the computation of S-polynomials. The methods are illustrated with elaborated examples.
0 references
computational algebra
0 references
Gröbner basis
0 references
Buchberger's algorithm
0 references
Möller- Gebauer algorithm
0 references
