This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Buchberger, B., An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal, Aequationes Mathematicae 4 (1970), 374–383. (Ph.D. Thesis, Math. Inst. Univ. Innsbruck, 1965).
—, A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner Bases, in “EUROSAM 79,” Lecture Notes in Computer Science 72, Springer Verlag, Berlin-Heidelberg-New York, 1979, pp. 3–21.
Gebauer, R., Möller, H. M., An installation of of Buchberger's algorithm, J. of Symbolic Computation (to appear).
Robbiano, L., Term orderings on the polynomial ring, in “EUROCAL 85,” Lecture Notes in Computer Science 204, Springer Verlag, Berlin-Heidelberg-New York, 1985, pp. 513–517.
Traverso, C., AIPi: a package to test different versions of the Gröbner basis completion algorithm. (to appear)
Wang, P. S., Guy, M., Davenport, J., p-adic reconstruction of rational numbers, A. C. M. SIGSAM Bull. 12 (1982), 2–3.
Winkler, F., A p-adic approach to the computation of Gröbner bases, in “EUROCAL 87, Leipzig,” Lecture Notes in Computer Science, Springer Verlag, Berlin-Heidelbrg-New York, 1987 (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Traverso, C. (1989). Gröbner trace algorithms. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-51084-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51084-0
Online ISBN: 978-3-540-46153-1
eBook Packages: Springer Book Archive