This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.A. Alonso, T. Mora, M. Raimondo. Local decomposition algorithms. Preprint (1990).
D. Bayer, A. Galligo, M. Stillman. Computation of primary decompositions. Preprint (1990).
D. Bayer, M. Stillman. On the complexity of computing syzygies. In Computational aspects of commutative algebra edited by L. Robbiano, Acad. Press (1989), 1–13.
D. Bayer, M. Stillman, M. Stillman. Macaulay, a Computer Algebra System. Harvard University and Cornell University USA (1990).
B. Buchberger. Ein Algorithmus zum Auffinden der Basis-elemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D Thesis, Universität Insbruck 1965.
B. Buchberger, G. Collins, R. Loos (edited by) Computer Algebra: symbolic and algebraic computation, Wien, New York, Springer Verlag 1983.
A. Dickenstein, N. Fitchas, M. Giusti, C. Sessa. The membership problem for unmixed polynomial ideals is solvable in subexponential time. Preprint (1989).
D. Eisenbud, C. Huneke, W. Vasconcelos. Direct methods for primary decomposition. Preprint (1990).
P. Gianni, B. Trager, G. Zacharias. Gröbner bases and primary decomposition of polynomials ideals, In Computational aspects of commutative algebra edited by L. Robbiano, Acad. Press (1989), 15–33.
A. Giovini, G. Niesi. CoCoA: a user-friendly system for Commutative Algebra. To appear in the Proceedings of the DISCO conference (Capri 1990).
M. Giusti. Some effective problems in polynomial ideal theory. Proceedings of EUROSAM 84. Springer Lec. Notes Comp. Sci. 174 (1984), 159–171.
W. GrÖbner. Algebraische Geometrie II Bibliographisches Institut, Mannheim 1970.
G. Hermann. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Math. Ann. 95 (1926), 736–788
R. Neuhaus. Computing radicals in a polynomial ring over a field of characteristic zero. Preprint, University of Dortmund (1990).
T. Krick, A. Logar. Membership problem, representation problem and the computation of the radical for one-dimensional ideals. To appear on Proceedings MEGA-90, edited by T. Mora and C. Traverso, Birkhäuser (1990).
D. Lazard. Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. Proceedings of EUROCAL 83. Springer Lec. Notes Comp. Sci. 162 (1983), 146–156.
A. Logar. A computational proof of the Noether Normalization lemma. Proceedings of A.A.E.C.C.-6, Rome 1988Springer Lec. Notes Comp. Sci. 357 (1988), 259–273.
H. Matsumura. Commutative ring theory. Cambridge University press, Cambridge 1986.
E. Mayr, A. Meyer. The complexity of the word problems for commutative semi-groups and polynomials ideals. Adv. in Math., 46 (1982), 305–329.
M. Nagata. Field Theory. Marcel Dekker, Inc. New York and Basel 1977.
L. Robbiano. Bounds for degrees and number of elements in Gröbner bases. To appear in the Proceedings of AAECC-8 Springer Lec. Notes Comp. Sci. (1990).
A. Seidenberg. Constructions in algebra. Trans. Amer. Math. Soc. 197 (1974), 273–313.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krick, T., Logar, A. (1991). An algorithm for the computation of the radical of an ideal in the ring of polynomials. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1991. Lecture Notes in Computer Science, vol 539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54522-0_108
Download citation
DOI: https://doi.org/10.1007/3-540-54522-0_108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54522-4
Online ISBN: 978-3-540-38436-6
eBook Packages: Springer Book Archive