On the construction of Gröbner bases using syzygies

From MaRDI portal
Publication:909718

DOI10.1016/S0747-7171(88)80052-XzbMath0695.13003OpenAlexW1988568284MaRDI QIDQ909718

Hans-Michael Möller

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(88)80052-x




Related Items (33)

A solution to Kronecker's problemBuchberger-Weispfenning theory for effective associative ringsStandard bases in mixed power series and polynomial rings over ringsOn ideal lattices, Gröbner bases and generalized hash functionsGröbner bases and primary decomposition in polynomial rings in one variable over Dedekind domainsSignature Gröbner bases in free algebras over ringsFunctors of liftings of projective schemesDe Nugis Groebnerialium 7: Janet, Gerdt, TamariA new algorithm for computing staggered linear basesEfficient Gröbner bases computation over principal ideal ringsGröbner bases, H–bases and interpolationReduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian ringsSemi-ring Based Gröbner–Shirshov Bases over a Noetherian Valuation RingOn Bayer's deformation and the associativity formulaGröbner bases with coefficients in ringsParametric FGLM algorithmSome results on Gröbner bases over commutative ringsA general framework for Noetherian well ordered polynomial reductionsOn lucky ideals for Gröbner basis computationsGröbner bases and primary decomposition of modulesBuchberger-Zacharias theory of multivariate Ore extensionsDynamical Gröbner bases over Dedekind ringsToward involutive bases over effective ringsEffective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent ringsZacharias representation of effective associative ringsSTANDARD BASES OVER RINGSComputational ideal theory in finitely generated extension ringsWhy you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failuresA primer on ideal theoretical operation in non-commutative polynomial ringsA signature-based algorithm for computing Gröbner bases over principal ideal domainsDe nugis Groebnerialium 6: Rump, Ufnarovski, ZachariasOn Gröbner bases under specializationA new algorithm for discussing Gröbner bases with parameters.



Cites Work


This page was built for publication: On the construction of Gröbner bases using syzygies