Effective computation of strong Gröbner bases over Euclidean domains
From MaRDI portal
Publication:372163
zbMATH Open1275.13021MaRDI QIDQ372163FDOQ372163
Authors: Daniel A. Lichtblau 
Publication date: 14 October 2013
Published in: Illinois Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ijm/1380287466
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
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)
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
- Title not available (Why is that?)
- 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)
