A Buchberger like algorithm without monomial orderings : the graded commutative case
Samuel Lundqvist · 2009
We analyze an algorithm to compute vector space bases for graded commutative algebras. The algorithm does not require a monomial ordering, but we show that when we use a monomial ordering, there is ...