Effective computation of strong Gröbner bases over Euclidean domains
From MaRDI portal
Publication:372163
zbMath1275.13021MaRDI QIDQ372163
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
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)
Related Items (6)
Standard bases in mixed power series and polynomial rings over rings ⋮ Computing free non-commutative Gröbner bases over \(\mathbb{Z}\) with \textsc{Singular:Letterplace} ⋮ Signature Gröbner bases in free algebras over rings ⋮ Standard bases over Euclidean domains ⋮ Efficient Gröbner bases computation over principal ideal rings ⋮ A signature-based algorithm for computing Gröbner bases over principal ideal domains
This page was built for publication: Effective computation of strong Gröbner bases over Euclidean domains
