Experimenting the Gröbner basis algorithm with the A1PI system

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Experimenting the Gröbner basis algorithm with the A1PI system

Full text

Pdf (820 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation table of contents

Portland, Oregon, United States

Pages: 192 - 198

Year of Publication: 1989

ISBN:0-89791-325-6

Authors

C. Traverso	Dipartimento di Matematica
L. Donati	Università di Pisa

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): 8, Citation Count: 4

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/74540.74564 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.

	Ba	David Allen Bayer, The division algorithm and the hilbert scheme, 1982
	BGK	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]
	Co	H. Cohn, An ezplicit modular equation in two variables and Hilbert's Twelfth Problem, Math. of Camp. 88 (1982), 227-236.
	CD	H. Calm, J. Deutsch, An e~plicit modular equation in two variables .for Q{~}, Math. of Camp. 50 (~gss), 557-568.
	GPT	André Galligo , Loic Pottier , Carlo Traverso, Greater Easy Common Divisor and Standard Basis Completion Algorithms, Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation, p.162-176, July 04-08, 1988
	GM	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]
	MM	H.M. Mailer, T. Mars, New constructive methods in classical ideal theory, Sour. of Algebra 100 (1986), 138-178.
	Mo1	Ferdinando Mora, An Algorithm to Compute the Equations of Tangent Cones, Proceedings of the European Computer Algebra Conference on Computer Algebra, p.158-165, April 05-07, 1982
	Mo2	On the tangent cone algorithm, Cornell conference on GrSbner basis algorithm.
	Tr	Carlo Traverso, Gröbner Trace Algorithms, Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation, p.125-138, July 04-08, 1988

CITED BY 4

	Massimo Caboara, A dynamic algorithm for Gröbner basis computation, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.275-283, July 06-08, 1993, Kiev, Ukraine
	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
	S. R. Czapor, A heuristic selection strategy for lexicographic Gröner bases?, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.39-48, July 15-17, 1991, Bonn, West Germany
	Alessandro Giovini , Teo Mora , Gianfranco Niesi , Lorenzo Robbiano , Carlo Traverso, “One sugar cube, please” or selection strategies in the Buchberger algorithm, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.49-54, July 15-17, 1991, Bonn, West Germany