Complexity of comparing monomials and two improvements of the BM-algorithm
Commutative Algebra
2010-10-20 v2
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.
Cite
@article{arxiv.0807.2370,
title = {Complexity of comparing monomials and two improvements of the BM-algorithm},
author = {Samuel Lundqvist},
journal= {arXiv preprint arXiv:0807.2370},
year = {2010}
}
Comments
21 pages