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.13011MaRDI 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
13F20: Polynomial rings and ideals; rings of integer-valued polynomials
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
Towards a Gröbner-free approach to coding, De Nugis Groebnerialium 7: Janet, Gerdt, Tamari, Polly cracker, revisited, 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, Multi-point evaluation in higher dimensions, Bar code for monomial ideals, De nugis Groebnerialium 6: Rump, Ufnarovski, Zacharias