On two signature variants of Buchberger's algorithm over principal ideal domains
From MaRDI portal
Publication:6666529
DOI10.1145/3452143.3465522MaRDI QIDQ6666529
Publication date: 20 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective computation of strong Gröbner bases over Euclidean domains
- On the construction of Gröbner bases using syzygies
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- On the D-bases of polynomial ideals over principal ideal domains
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Magma algebra system. I: The user language
- A survey on signature-based algorithms for computing Gröbner bases
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases
- Standard bases over Euclidean domains
- Strong Gröbner bases and cyclic codes over a finite-chain ring
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- A new incremental algorithm for computing Groebner bases
- A new framework for computing Gröbner bases
- Generalized Compact Knapsacks Are Collision Resistant
- On Signature-Based Gröbner Bases Over Euclidean Rings
- Signature-based algorithms to compute Gröbner bases
- Applications of strong Grobner bases over Euclidean domains
This page was built for publication: On two signature variants of Buchberger's algorithm over principal ideal domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666529)
