A heuristic selection strategy for lexicographic Gröner bases?

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A heuristic selection strategy for lexicographic Gröner bases?

Full text

Pdf (842 KB)

Source

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

Bonn, West Germany

Pages: 39 - 48

Year of Publication: 1991

ISBN:0-89791-437-6

Author

S. R. Czapor

Department of Mathematics, Statistics and Computing Science, Dalhousie University, Halifax, Nova Scotia, Canada B3H 3J5

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 22, 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/120694.120700 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.

	1	B. Buchberger and F. Winkler, "Miscellaneous Results on the Construction of Gr0bner Bases for Polynomial ideals," Tech. Rep. 137, Univ. of Linz, Math. Inst., 1979.
	2	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
	3	B. Buchberger, "Gr6bner Bases: An Algorithmic Method in Polynomial Ideal Theory," in Progress, directions and open problems in multidimensional systems theory, ed. N.K. Bose, pp. 184-232, D. Reidel, 1985.
	4	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]
	5	S. R. Czapor , K. O. Geddes, On implementing Buchberger's algorithm for Grobner bases, Proceedings of the fifth ACM symposium on Symbolic and algebraic computation, p.233-238, July 21-23, 1986, Waterloo, Ontario, Canada [doi>10.1145/32439.32486]
	6	Stephen R. Czapor, Solving algebraic equations via Buchberger's algorithm, Proceedings of the European Conference on Computer Algebra, p.260-269, June 02-05, 1987
	7	S.R. Czapor, "GrObner Basis Methods for Solving Algebraic Equations," Ph.D. Thesis, University of Waterloo, Dept. of Applied Math., 1988.
	8	S. R. Czapor, Solving algebraic equations: combining Buchberger's algorithm with multivariate factorization, Journal of Symbolic Computation, v.7 n.1, p.49-53, Jan. 1989 [doi>10.1016/S0747-7171(89)80005-7]
	9	J.C. Faug~re, P. Gianni, D. Lazard, and T. Mora, "Efficient Computation of Zero-Dimensional GrObner Bases by Change of Ordering," Preprint, 1990.
	10	C. William Gear, Numerical Initial Value Problems in Ordinary Differential Equations, Prentice Hall PTR, Upper Saddle River, NJ, 1971
	11	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]
	12	A. Giovini and G. Niesi, CoCoA User's Manual, University of Genova, Dept. of Math., 1989.
	13	Ken Rimey, Problem section (rotating fluids): a system of polynomial equations and a solution by an unusual method, ACM SIGSAM Bulletin, v.18 n.1, p.30-32, February 1984 [doi>10.1145/1089348.1089353]
	14	C. Traverso , L. Donati, Experimenting the Gröbner basis algorithm with the A1PI system, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.192-198, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74564]
	15	Franz Winkler, A p-adic approach to the computation of Gro¨bner bases, Journal of Symbolic Computation, v.6 n.2-3, p.287-304, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80049-X]

CITED BY 4

	David Eppstein, Fast hierarchical clustering and other applications of dynamic closest pairs, Journal of Experimental Algorithmics (JEA), 5, p.1-es, 2000
	Beatrice Amrhein , Oliver Gloor , Wolfgang Küchlin, A case study of multi-threaded Gröbner basis completion, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.95-102, July 24-26, 1996, Zurich, Switzerland
	David Eppstein, Fast hiearchical clustering and other applications of dynamic closet pairs, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.619-628, January 25-27, 1998, San Francisco, California, United States
	Gerrit Groenewold, Optimal ladder filters, IEEE Transactions on Circuits and Systems II: Express Briefs, v.56 n.2, p.147-151, February 2009