Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm

DOI10.1007/978-3-540-89994-5_9MaRDI QIDQ5504568zbMATH OpenOpenAlexFDO

Authors Samuel Lundqvist

Publication date 22 January 2009

Published in Mathematical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0807.2370

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

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.

Cited in

(13)

• Multiplication matrices and ideals of projective dimension zero
• Bar code for monomial ideals
• Degröbnerization: a political manifesto
• Vector space bases associated to vanishing ideals of points
• Recursive structures in involutive bases theory
• scientific article; zbMATH DE number 5849947 (Why is no real title available?)
• scientific article; zbMATH DE number 2125608 (Why is no real title available?)
• Computing Gröbner bases associated with lattices
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• Parametric FGLM algorithm
• Algorithmic local monomialization of a binomial: A comparison of different approaches
• On Saturation of Zero-Dimensional Ideals
• Bar code: a visual representation for finite sets of terms and its applications

This page was built for publication: Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504568)