Strategy-accurate parallel buchberger algorithms †

Journal of Symbolic Computation

Volumn 21, Issue 4-6, 1996, Pages 411-425

  Attarde, Giuseppe ^a   Traverso, Carlo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030119340     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0022     Document Type: Article

References (22)

1. Attardi, G. (1995). The embeddable common Lisp. ACM Lisp Pointers, 8(1), 30-41.
2. Attardi, G., Traverso, C. (1995). The PoSSo Library for Polynomial System Solving. Proc. AIHENP95, Singapore, World Scientific Publishing Company.
3. Becker, T., Weispfenning, V. (1993). Gröbner bases. Berlin, Springer-Verlag, GTM 141.
4. Boege, W., Gebauer, R., Kredel, H. (1986). Some Examples for Solving Systems of Algebraic Equations by Calculating Grobner Bases. J. Symbolic Computation, 2, 83-89.
5. Buchberger, B. (1965). An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal. Ph.D. Thesis, Math. Inst., Univ. of Innsbruck, Austria.
6. Buchberger, B. (1985). Gröbner bases: an algorithmic method in polynomial ideal theory. Recent Trends in Multidimensional Systems Theory, Bose, N.K., (ed.), New York, D. Reidel Publ. Co., pp. 184-232.
7. Buchberger, B. (1987). The parallelization of critical pair completion procedures on the L-machine. Proc. Japanese Symposium on functional programming, 54-61.
8. Bündgen, R., Göbel, M., Küchlin, W. (1994). A fine-grained parallel completion procedure. Proc. ISSAC'94, Oxford.
9. Chakrabarti, S., Yelick, K. (1994). Distributed data structures and algorithms for Gröebner basis computation. Lisp and Symbolic Computation, 7, 1-27.
10. Cox, D., Little, J., O'Shea, D. (1991). Ideals, varieties, and algorithms. UTM, Berlin, Springer-Verlag.
11. Faugère, J.C. (1994). Résolution des systèmes d'équations algébriques. Ph.D. thesis, Université Paris 6.
12. Faugère, J.C., Gianni, P., Lazard, D., Mora, T. (1993). Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symbolic Computation, 16(4), 329-344.
13. Gebauer, R., Möller, H.M. (1988). On an installation of Buchberger's algorithm. J. Symbolic Computation, 6(2 and 3), 275-286.
14. Giovini, A., Mora, T., Niesi, G., Robbiano, L., Traverso, C. (1991). "One sugar cube, please" OR Selection strategies in Buchberger algorithm. Proc. ISSAC'91, ACM, July, 49-54.
15. Message Passing Interface Forum (1994). MPI: A Message-Passing Interface Standard. International J. Supercomputing Applications, 8(3-4).
16. Mishra, B. (1993). Algorithmic Algebra,. Text and monographs in Computer Science, Berlin, Springer-Verlag.
17. Pauer, F., Pfeifhofer, M. (1988). The theory of Gröbner bases. L'Enseignement Math., 34, 215-232.
18. Sawada, H., Terasaki, S., Aiba, A. (1994). Parallel computation of Gröbner Bases on distributed memory machines, J. Symbolic Computation, 18, 3, 207-222.
19. Senechaud, P. (1989). Implementation of a parallel algorithm to compute a Gröbner basis on boolean polynomials. Computer Algebra, and parallelism, New York, Academic Press, 159-166.
20. Traverso, C. (1996). Hilbert functions and Buchberger algorithm. Submitted.
21. Traverso, C., Donati, L. (1989). Experimenting the Gröbner basis algorithm with the AlPI system. Proc. ISSAC'89, ACM.
22. Vidai, J.P. (1990). The computation of Gröbner bases on a shared memory multiprocessor. Design and implementation of symbolic computation systems, Lecture Notes in Computer Science 429, Berlin, Springer-Verlag, 81-90.