A.6 ʸ¸¥
[Batut et al.]
- Batut, C., Bernardi, D., Cohen, H., Olivier, M., "User's Guide to PARI-GP",
1993.
[Becker,Weispfenning]
- Becker, T., Weispfenning, V., "Groebner Bases", Graduate Texts in Math. 141,
Springer-Verlag, 1993.
[Boehm,Weiser]
- Boehm, H., Weiser, M., "Garbage Collection in an Uncooperative
Environment", Software Practice & Experience, September 1988, 807-820.
[Gebauer,Moeller]
- Gebauer, R., Moeller, H. M., "An installation of Buchberger's algorithm",
J. of Symbolic Computation 6, 275-286.
[Giovini et al.]
- Giovini, A., Mora, T., Niesi, G., Robbiano, L., Traverso, C.,
""One sugar cube, please" OR Selection strategies in the Buchberger algorithm",
Proc. ISSAC'91, 49-54.
[Noro,Takeshima]
- Noro, M., Takeshima, T., "Risa/Asir -- A Computer Algebra System",
Proc. ISSAC'92, 387-396.
[Noro,Yokoyama]
- Noro, M., Yokoyama, K., "A Modular Method to Compute the Rational Univariate
Representation of Zero-Dimensional Ideals",
J. Symb. Comp. 28/1 (1999), 243-263.
[Saito,Sturmfels,Takayama]
- Saito, M., Sturmfels, B., Takayama, N.,
"Groebner deformations of hypergeometric differential equations",
Algorithms and Computation in Mathematics 6, Springer-Verlag (2000).
[Shimoyama,Yokoyama]
- Shimoyama, T., Yokoyama, K.,
"Localization and primary decomposition of polynomial ideals",
J. Symb. Comp. 22 (1996), 247-277.
[Shoup]
- Shoup, V., "A new polynomial factorization algorithm and its implementation",
J. Symb. Comp. 20 (1995), 364-397.
[Traverso]
- Traverso, C., "Groebner trace algorithms", Proc. ISSAC '88(LNCS 358), 125-138.
[Weber]
- Weber, K., "The accelerated Integer GCD Algorithm", ACM TOMS, 21, 1(1995), 111-122.
[Yokoyama]
- Yokoyama, K., "Prime decomposition of polynomial ideals over finite fields",
Proc. ICMS, (2002), 217-227.
This document was generated
by root on March, 5 2004
using texi2html