Efficient algorithms for ideal operations (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient algorithms for ideal operations (extended abstract)

Full text

Pdf (221 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1998 international symposium on Symbolic and algebraic computation table of contents

Rostock, Germany

Pages: 147 - 152

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

Massimo Caboara	Dipartimento di Matematica, Università di Pisa, Italy
Carlo Traverso	Dipartimento di Matematica, Università di Pisa, Italy

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 20, 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/281508.281597 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.

	BGS	Bayer, D., Galligo, A., Stillman, M., (1991). On primary decomposition, preliminary version of an unpublished paper.
	BW	Thomas Becker , Volker Weispfenning , Heinz Kredel, Gro¨bner bases: a computational approach to commutative algebra, Springer-Verlag, London, 1993
	CCT	Massimo Caboara , Pasqualina Conti , Carlo Traverso, Yet Another Ideal Decomposition Algorithm, Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.39-54, June 23-27, 1997
	CS	Caboara, M. and Silvestri M., (1997). Compatible module orderings. To appear on the J. of Pure and Applied Algebra.
	CNR	Capani, A., Niesi, G., and Robbiano, L., CoCoA, a system for doing Computations in Commutative Algebra, Dip. Matematica, Universitg di Genova, Available via anonymous ftp from cocoa, dima. unige, it. Web page http://cocoa, dima. unige, it.
	Eis	Eisenbud D., (1994). Commutative Algebra with a View Toward Algebraic Geometry, Springer Verlag, Graduate Text in Mathematics.
	GTZ	Patrizia Gianni , Barry Trager , Gail Zacharias, Gro¨bner bases and primary decomposition of polynomial ideals, Journal of Symbolic Computation, v.6 n.2-3, p.149-167, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80040-3]
	MM	M511er, H.M. and Mora F., (1986). New constructive methods in classical ideal theory. J. Algebra 100, pp. 138-178.
	Sp	Spear, D.A., (1977).A constructive approach to commutative ring theory, In: Proc, MACSYMA User's conference, NASA CP-2012, pp. 369-376.
	Tr	Carlo Traverso, Hilbert functions and the Buchberger algorithm, Journal of Symbolic Computation, v.22 n.4, p.355-376, Oct. 1996 [doi>10.1006/jsco.1996.0056]

CITED BY 3

	Carlo Traverso , Alberto Zanoni, Numerical stability and stabilization of Groebner basis computation, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.262-269, July 07-10, 2002, Lille, France
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	Michael Monagan , Roman Pearce, Rational simplification modulo a polynomial ideal, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy