Efficiently Computing Minimal Sets of Critical Pairs
| dc.creator | Caboara, M. | |
| dc.creator | Kreuzer, M. | |
| dc.creator | Robbiano, L. | |
| dc.date | 2003-10-09 | |
| dc.date.accessioned | 2026-07-07T05:01:45Z | |
| dc.date.available | 2026-07-07T05:01:45Z | |
| dc.description | In the computation of a Gr"obner basis using Buchberger's algorithm, a key issue for improving the efficiency is to produce techniques for avoiding as many unnecessary critical pairs as possible. A good solution would be to avoid _all_ non-minimal critical pairs, and hence to process only a_minimal_ set of generators of the module generated by the critical syzygies. In this paper we show how to obtain that desired solution in the homogeneous case while retaining the same efficiency as with the classical implementation. As a consequence, we get a new Optimized Buchberger Algorithm. | |
| dc.description | LaTeX using elsart.cls, 27 pages | |
| dc.identifier | https://arxiv.org/abs/math/0310130 | |
| dc.identifier | http://arxiv.org/abs/math/0310130 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/68794 | |
| dc.subject | Commutative Algebra | |
| dc.subject | 14P10 | |
| dc.title | Efficiently Computing Minimal Sets of Critical Pairs | |
| dc.type | text |