Buchberger's algorithm and staggered linear bases

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Buchberger's algorithm and staggered linear bases

Full text

Pdf (382 KB)

Source

Symposium on Symbolic and Algebraic Manipulation archive
Proceedings of the fifth ACM symposium on Symbolic and algebraic computation table of contents

Waterloo, Ontario, Canada

Pages: 218 - 221

Year of Publication: 1986

ISBN:0-89791-199-7

Authors

Rüdiger Gebauer	IBM T. J. Watson Research Center, Yorktown Heights, NY
H. Michael Möller	FernUniv. Hagen

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 17, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/32439.32482 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	BGK86	W. Boege , R. Gebauer , H. Kredel, Some examples for solving systems of algebraic equations by calculating Groebner, Journal of Symbolic Computation, v.2 n.1, p.83-98, March 1986 [doi>10.1006/jsco.1996.0042]
	Bu65	Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemcnte des Restklassenrings nach einem nulldimensionalen Polynomideal. PhD Thesis, University of Innsbruck, 1965
	Bu70	Buchberger, B.: Ein algorithmisches Kriteriurn fur die LOsbarkeit eines algebraischcu Gleichungssytems Aequ. Math. 4, 1970
	Bu79	Bruno Buchberger, A criterion for detecting unnecessary reductions in the construction of Groebner bases, Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, p.3-21, June 01, 1979
	Bu85	Buchberger, B.: GrObner bases: An algorithmic method in polynomial ideal theory, in "Recent trends in Multidimensional systems theory", (ed. by N.Bose), Rcidel Publ. Comp. 1985, Chapter 6
	GM86	Rüdiger Gebauer , H. Michael Möller, On an installation of Buchberger's algorithm, Journal of Symbolic Computation, v.6 n.2-3, p.275-286, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80048-8]
	Je86	Jenks, R. D.: Scratchpad Ii Computer Algebra System, IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598, 1986
	La83	Daniel Lazard, Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations, Proceedings of the European Computer Algebra Conference on Computer Algebra, p.146-156, March 28-30, 1983
	MM86	Mora, F., MOiler, H.M.: New constructive methods in classical ideal theory. To appear in Journal of Algebra, 1986

CITED BY 3

	Roberto La Scala, An algorithm for complexes, Proceedings of the international symposium on Symbolic and algebraic computation, p.264-268, July 20-22, 1994, Oxford, United Kingdom
	H. Michael Möller , Teo Mora , Carlo Traverso, Gröbner bases computation using syzygies, Papers from the international symposium on Symbolic and algebraic computation, p.320-328, July 27-29, 1992, Berkeley, California, United States
	Jean Charles Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F₅), Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.75-83, July 07-10, 2002, Lille, France