On the Walk

Theoretical Computer Science

Volumn 187, Issue 1-2, 1997, Pages 179-202

  Amrhein, Beatrice ^a   Gloor, Oliver ^a   Küchlin, Wolfgang ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING;

GROBNER BASIS COMPUTATION;

POLYNOMIALS;

EID: 0031269034     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00064-9     Document Type: Article

References (26)

1. B. Amrhein, O. Gloor, W. Küchlin, A case study of multi-threaded Gröbner basis completion, in: Y.N. Lakshman (Ed.), ISSAC'96, Zurich, Switzerland, ACM Press, New York, 1996, pp. 95-102.
2. B. Amrhein, O. Gloor, W. Küchlin, How fast does the Walk run?, in: A. Carrière, L.R. Oudin (Eds.), 5th Rhine Workshop on Computer Algebra, Saint-Louis, France, 1996, ISL, pp. 8.1-8.9.
3. B. Amrhein, O. Gloor, W. Küchlin, Walking faster, in: J. Calmet, C. Limongelli (Eds.), DISCO'96, Karlsruhe, Germany, Lecture Notes in Computer Science, vol. 1128, Springer, Berlin, 1996, pp. 150-161.
4. Buchberger, Collins, Encarnación, Hong, Johnson, Krandick, Loos, Mandache, Neubacher, Vielhaber, SACLIB User's Guide, 1993. On-line software documentation.
5. B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. thesis, Universität Innsbruck, 1965.
6. B. Buchberger, Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems, Aequationes Math. 4 (3) (1970) 374-383.
7. B. Buchberger, A criterion for detecting unnecessary reductions in the construction of Gröbner-Bases, in: E.W. Ng (Ed.), EUROSAM'79, Marseille, France, Lecture Notes in Computer Science, vol. 72, Springer, Berlin, 1979, pp. 3-21.
8. B. Buchberger, Gröbner bases: an algorithmic method in polynomial ideal theory, in: N.K. Bose (Ed.), Recent Trends in Multidimensional Systems Theory, Reidel, Dordrecht, 1985, chap. 6.
9. S. Collart, M. Kalkbrener, D. Mall, Converting bases with the Gröbner Walk, J. Symbol. Comput. 1997, to print.
10. S. Collart, D. Mall. The ideal structure of Gröbner base computations, Preprint, 1994.
11. D. Cox, J. Little, D. O'Shea, Ideals, Varieties, and Algorithms, Undergraduate Texts in Mathematics, Springer, Berlin, 1992.
12. J. Faugère, P. Gianni, D. Lazard, T. Mora, Efficient computation of zero-dimensional Gröbner bases by change of ordering, J. Symbol. Comput. 16 (1993) 329-344.
13. J.C. Faugère, Résolution des systèmes d'équations algébriques, Ph.D. thesis, Université Paris 6, 1994.
14. C. Traverso, Hilbert functions and the Buchberger algorithm, J. Symbolic Comput. 22(4) (1996) 355-376.
15. C. Hoffmann, Geometric and Solid Modeling: An Introduction, Morgan Kaufmann, Los Altos, CA, 1989.
16. M. Kalkbrener, Implicitization of rational curves and surfaces, in: S. Sakata (Ed.), AAECC-8, Lecture Notes in Computer Science, vol. 508, Tokyo, Japan, Springer, Berlin, 1990, pp. 249-259.
17. M. Kalkbrener, Implicitization by Gröbner basis conversion, in: IMACS'95, Albuquerque, NM, 1995. http://math.unm.edu/ACA/1995/Proceedings.
18. R. Klein, Netzgenerierung impliziter und parametrischer Kurven und Flächen in einem objektorientierten System, Ph.D. Thesis, Eberhard-Karls-Universität, Tübingen, 1995.
19. W.W. Küchlin, PARSAC-2: Parallel computer algebra on the desk-top, in: J. Fleischer, J. Grabmeier, F. Hehl, W. Küchlin (Eds.), Computer Algebra in Science and Engineering, World Scientific, Singapore, 1995, pp. 24-43.
20. S. Licciardi, T. Mora, Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion, in: J. von zur Gathen, M. Giesbrecht (Eds.), ISSAC'94, Oxford, England, ACM Press, New York, 1994, pp. 191-196.
21. T. Mora, L. Robbiano, The Gröbner Fan of an ideal, J. Symbol. Comput. 6 (1988) 183-208.
22. PoSSo, Polynomial systems library, ftp: posso.dm.unipi.it.
23. A. Steel, The Magma Gröbner Walk, 1996, Preprint.
24. V. Weispfenning, Admissible orders and linear forms, ACM Sigsam Bull. 21 (2) (1987) 16-18.
25. W. Windsteiger, B. Buchberger, GRÖBNER: A Library for computing Gröbner Bases based on SACLIB, Manual for Version 2.0, 1993.
26. D.Y.Y. Yun, On algorithms for solving systems of polynomial equations, ACM Sigsam Bull. 27 (1973) 19-25.