Complexity of comparing monomials and two improvements of the BM-algorithm
Samuel Lundqvist
TL;DR
This paper introduces a new algorithm for merging sorted monomial lists and, combined with a projection technique, achieves improved complexity bounds for the BM-algorithm, enhancing computational efficiency in algebraic computations.
Contribution
The paper presents a novel merging algorithm and a projection technique that together improve the complexity bounds of the BM-algorithm.
Findings
New efficient merging algorithm for monomials
Enhanced complexity bounds for the BM-algorithm
Potential improvements in algebraic computation efficiency
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Database Systems and Queries · Data Management and Algorithms