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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abbott, J., Bigatti, A., Kreuzer, M., Robbiano, L.: Computing ideals of points. J. Symb. Comput. 30(4), 341–356 (2000)
Borges-Trenard, M.A., Borges-Quintana, M., Mora, T.: Computing Gröbner bases by FGLM techniques in a non-commutative setting. J. Symb. Comput. 30(4), 429–449 (2000)
Buchberger, B., Möller, M.: The construction of multivariate polynomials with preassigned zeroes. In: Calmet, J. (ed.) ISSAC 1982 and EUROCAM 1982. LNCS, vol. 144, pp. 24–31. Springer, Heidelberg (1982)
Faugre, J.C., Gianni, P., Lazard, D., Mora, T.: Efficient Computation of Zero-Dimensional Gröbner Basis by Change of Ordering. J. Symb. Comput. 16(4), 329–344 (1993)
Frer, M.: Faster integer multiplication. In: Proceedings of the 39th ACM STOC 2007 conference, pp. 57–66 (2007)
Just, W., Stigler, B.: Computing Gröbner bases of ideals of few points in high dimensions. Communications in Computer Algebra 40(3), 65–96 (2006)
Just, W., Stigler, B.: Efficiently computing Groebner bases of ideals of points (2007) (arXiv:0711.3475)
Kühnle, K., Mayr, E.W.: Exponential space computation of Gröbner bases. In: ISSAC 1996: Proceedings of the 1996 international symposium on Symbolic and algebraic computation, pp. 63–71 (1996)
Laubenbacher, R., Stigler, B.: A computational algebra approach to the reverse-engineering of gene regulatory networks. J. Theor. Biol. 229, 523–537 (2004)
Marinari, M., Möller, H.M., Mora, T.: Gröbner bases of ideals defined by functionals with an application to ideals of projective points. Applicable Algebra in Engineering, Communication and Computing 4, 103–145 (1993)
Robbiano, L.: Term orderings on the polynomial ring. In: Caviness, B.F. (ed.) ISSAC 1985 and EUROCAL 1985. LNCS, vol. 204, pp. 513–517. Springer, Heidelberg (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lundqvist, S. (2008). Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm. In: Calmet, J., Geiselmann, W., Müller-Quade, J. (eds) Mathematical Methods in Computer Science. Lecture Notes in Computer Science, vol 5393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89994-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-89994-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89993-8
Online ISBN: 978-3-540-89994-5
eBook Packages: Computer ScienceComputer Science (R0)