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

Authors:
Samuel Lundqvist
Affiliations:
Department of Mathematics, Stockholm University, Stockholm, Sweden SE-106 91
Venue:
Mathematical Methods in Computer Science
Year:
2008

Citing 8
Cited 0

Efficient computation of zero-dimensional Gro¨bner bases by change of ordering

Journal of Symbolic Computation
Exponential space computation of Gröbner bases

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Computing ideals of points

Journal of Symbolic Computation - Special issue on applications of the Gröbner basis method
Computing Gröbner bases by FGLM techniques in a non-commutative setting

Journal of Symbolic Computation - Special issue on applications of the Gröbner basis method
The Construction of Multivariate Polynomials with Preassigned Zeros

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Term Orderings on the Polynominal Ring

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Faster integer multiplication

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computing Gröbner bases of ideals of few points in high dimensions

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

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 Buchberger-Möller algorithm.