Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
From MaRDI portal
Publication:5504568
DOI10.1007/978-3-540-89994-5_9zbMath1178.68691arXiv0807.2370OpenAlexW2168553484MaRDI QIDQ5504568
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
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items (9)
Computing Gröbner bases associated with lattices ⋮ Vector space bases associated to vanishing ideals of points ⋮ An FGLM-like algorithm for computing the radical of a zero-dimensional ideal ⋮ Multiplication matrices and ideals of projective dimension zero ⋮ Recursive structures in involutive bases theory ⋮ Parametric FGLM algorithm ⋮ Bar code for monomial ideals ⋮ Bar code: a visual representation for finite sets of terms and its applications ⋮ Degröbnerization: a political manifesto
This page was built for publication: Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
