De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
From MaRDI portal
Publication:1396695
DOI10.1007/s00200-002-0112-2zbMath1017.13011OpenAlexW2008028123MaRDI QIDQ1396695
Publication date: 8 July 2003
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-002-0112-2
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (8)
Polly cracker, revisited ⋮ Multi-point evaluation in higher dimensions ⋮ Towards a Gröbner-free approach to coding ⋮ De Nugis Groebnerialium 7: Janet, Gerdt, Tamari ⋮ Bar code for monomial ideals ⋮ Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures ⋮ Bar code: a visual representation for finite sets of terms and its applications ⋮ De nugis Groebnerialium 6: Rump, Ufnarovski, Zacharias
This page was built for publication: De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis