Mathematics – Commutative Algebra
Scientific paper
2008-07-15
MMISC 2008, Lecture Notes in Comput. Sci. 5393 (2008), 105--125
Mathematics
Commutative Algebra
21 pages
Scientific paper
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.
No associations
LandOfFree
Complexity of comparing monomials and two improvements of the BM-algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Complexity of comparing monomials and two improvements of the BM-algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of comparing monomials and two improvements of the BM-algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-596166