Applications of strong Grobner bases over Euclidean domains
From MaRDI portal
Publication:5400779
DOI10.12988/ija.2013.13037zbMath1285.13037OpenAlexW2510996585MaRDI QIDQ5400779
Publication date: 12 March 2014
Published in: International Journal of Algebra (Search for Journal in Brave)
Full work available at URL: http://www.m-hikari.com/ija/ija-2013/ija-5-8-2013/lichtblauIJA5-8-2013.pdf
Gröbner basisHermite normal formEuclidean domainlattice reductionHensel liftinglinear Diophantine systemsPopov form
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 (3)
Approximate polynomial GCD by approximate syzygies ⋮ Effective solution of linear Diophantine equation systems with an application in chemistry ⋮ A signature-based algorithm for computing Gröbner bases over principal ideal domains
Uses Software
This page was built for publication: Applications of strong Grobner bases over Euclidean domains
