Computing Grobner Bases by FGLM Techniques in a
M. A. Borges-Trenard, M. Borges-Quintana, Teo Mora · 2000
A generalization of the FGLM technique is given to compute Grobner bases for two-sided ideals of free nitely generated algebras. Specializations of this algorithm are presented for the cases in which the ideal is determined by either functionals or monoid (group) pre- sentations. Generalizations are discussed in order to compute Grobner bases on (twisted) semigroup rings. c 2000 Academic Press