Complexity of comparing monomials and two improvements of the BM-algorithm

Abstract

We give a new algorithm for merging sorted lists of monomials. Together with a projection technique we obtain a new complexity bound for the BM-algorithm.

21 pages

References in corpus (2)

• A Computational Algebra Approach to the Reverse Engineering of Gene Regulatory Networks
• Efficiently computing Groebner bases of ideals of points

Cited by in corpus (2)

• Combinatorics of ideals of points: a Cerlienco-Mureddu-like approach for an iterative lex game
• Vector space bases associated to vanishing ideals of points