Effective computation of strong Gröbner bases over Euclidean domains
From MaRDI portal
(Redirected from Publication:372163)
Recommendations
- Applications of strong Gröbner bases over Euclidean domains
- An efficient method for computing comprehensive Gröbner bases
- Computer Aided Systems Theory – EUROCAST 2005
- An efficient implementation for computing Gröbner bases over algebraic number fields
- Computation of Gröbner bases
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Practical Gröbner basis computation
- Computing strong regular characteristic pairs with Gröbner bases
- A new framework for computing Gröbner bases
- scientific article; zbMATH DE number 3899033
Cited in
(13)- Signature Gröbner bases in free algebras over rings
- Applications of strong Gröbner bases over Euclidean domains
- Efficient Gröbner bases computation over principal ideal rings
- Standard bases over Euclidean domains
- A signature-based algorithm for computing Gröbner bases over principal ideal domains
- Computing free non-commutative Gröbner bases over \(\mathbb{Z}\) with \textsc{Singular:Letterplace}
- On the D-bases of polynomial ideals over principal ideal domains
- scientific article; zbMATH DE number 3899033 (Why is no real title available?)
- Standard bases in mixed power series and polynomial rings over rings
- The F\(_{4}\)-algorithm for Euclidean rings
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Strong Gröbner bases and linear algebra in multivariate polynomial rings over Euclidean domains
- On two signature variants of Buchberger's algorithm over principal ideal domains
This page was built for publication: Effective computation of strong Gröbner bases over Euclidean domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372163)
