An Algorithm for the Computation of the Radical of an Ideal in the Ring of Polynomials

[1]  Teresa Krick,et al.  Membership problem, Representation problem and the Computation of the Radical for one-dimensional Ideals , 1991 .

[2]  Marc Giusti,et al.  Some Effectivity Problems in Polynomial Ideal Theory , 1984, EUROSAM.

[3]  Alicia Dickenstein,et al.  The membership problem for unmixed polynomial ideals is solvable in single exponential time , 1991, Discret. Appl. Math..

[4]  D. Eisenbud,et al.  Direct methods for primary decomposition , 1992 .

[5]  Grete Hermann,et al.  Die Frage der endlich vielen Schritte in der Theorie der Polynomideale , 1926 .

[6]  Gianfranco Niesi,et al.  CoCoA: a User-Friendly System for Commutative Algebra , 1990, DISCO.

[7]  A. Seidenberg.  Constructions in algebra , 1974 .

[8]  Lorenzo Robbiano,et al.  Bounds for Degrees and Number of Elements in Gröbner Bases , 1990, AAECC.

[9]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[10]  Daniel Lazard,et al.  Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations , 1983, EUROCAL.

[11]  Teo Mora,et al.  Local Decomposition Algorithms , 1990, AAECC.

[12]  Miles Reid,et al.  Commutative Ring Theory , 1989 .

[13]  Alessandro Logar,et al.  A Computational Proof of the Noether Normalization Lemma , 1988, AAECC.

[14]  Bruno Buchberger,et al.  Computer algebra symbolic and algebraic computation , 1982, SIGS.

[15]  John Fitch.  Proceedings of EUROSAM 84 , 1984 .

[16]  Michael Eugene Stillman,et al.  On the Complexity of Computing Syzygies , 1988, J. Symb. Comput..