Computation of real radicals of polynomial ideals - II

Journal of Pure and Applied Algebra

Volumn 124, Issue 1-3, 1998, Pages 261-280

  Neuhaus, Rolf ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031990029     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(96)00103-X     Document Type: Article

References (23)

1. [1] M.E. Alonso, T. Mora and M. Raimondo, Local decomposition algorithms, Proc. AAECC-8, Tokyo, Japan, August 1990, Lecture Notes in Computer Science, Vol. 508 (Springer, Berlin, 1990) 208-221.
2. [2] E. Becker and R. Neuhaus, Computation of real radicals of polynomial ideals, Proc. MEGA-92, Nice, France, April 1992 (Birkhäuser, Basel, 1993) 1-20.
3. [3] J. Bochnak, M. Coste and M.-F. Roy, Géométrie algébrique réelle, in: Ergebnisse der Mathematik und ihrer Grenzgebiete, Folge 3, Vol. 12 (Springer, Berlin, 1987).
4. [4] T.W. Dubé, Quantitative analysis of problems in computer algebra: Gröbner bases and the nullstellensatz, (New York University, Courant Institute of Mathematical Sciences, 1989).
5. [5] D.W. Dubois, A nullstellensatz for ordered fields, Ark. Mat. 8 (1969) 111-114.
6. [6] D. Eisenbud and C. Huneke, A Jacobian method for finding the radical of an ideal, preprint, 1989.
7. [7] R. Elman, T.Y. Lam and A.R. Wadsworth, Orderings under field extensions, J. Reine Angewandte Math. 306 (1979) 7-27.
8. [8] P. Gianni and T. Mora, Algebraic solution of systems of polynomial equations using Gröbner bases, Proc. AAECC-5, June 1987, Lecture Notes in Computer Science, Vol. 356 (Springer, Berlin, 1987) 247-257.
9. [9] P. Gianni, B. Trager and G. Zacharias, Gröbner bases and primary decomposition of polynomial ideals, in: Computational Aspects of Commutative Algebra (Academic Press, New York, 1989) 15-33.
10. [10] M. Giusti, Some effectivity problems in polynomial ideal theory, Proc. Eurosam 84, Cambridge, England, July 1984, Lecture Notes in Computer Science, Vol. 174 (Springer, Berlin, 1984) 159-171.
11. [11] M. Knebusch and C. Scheiderer, Einführung in die reelle Algebra, Vieweg-Studium, Vol. 63 (Vieweg, Braunschweig, 1989).
12. [12] H. Kobayashi, S. Moritsugu and R.W. Hogan, On radical zero-dimensional ideals, J. Symbolic Comput. 8 (1989) 545-552.
13. [13] H. Kredel and V. Weispfenning, Computing dimension and independent sets for polynomial ideals, in: Computational Aspects of Commutative Algebra (Academic Press, New York, 1989) 97-113.
14. [14] T. Krick and A. Logar, An algorithm for the computation of the radical of an ideal in the ring of polynomials, Proc. AAECC-9, New Orleans, LA, October 1991, Lecture Notes in Computer Science, Vol. 539 (Springer, Berlin, 1991) 195-205.
15. [15] J.L. Krivine, Anneaux préordonnés, J. Anal. Math. 12 (1964) 307-326.
16. [16] E. Kunz, Einführung in die kommutative Algebra und algebraische Geometrie, Vieweg-Studium, Vol. 46 (Vieweg, Braunschweig, 1979).
17. [17] Y.N. Lakshman, On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal, Proc. 22nd ACM Symp. on Theory of Computing, May 1990.
18. [18] T.Y. Lam, An introduction to real algebra, Rocky Mountain J. Math. 14 (1984) 767-814.
19. [19] S. Lang, Algebra (Addison-Wesley, Reading, MA, 6th edn., 1974).
20. [20] H.M. Möller and F. Mora, Upper and lower bounds for the degree of Gröbner bases, Proc. Eurosam 84, Cambridge, England, Lecture Notes in Computer Science, Vol. 174 (Springer, Berlin, 1984) 172-183.
21. [21] J.-J. Risler, Une caractérisation des idéaux des variétés algébriques réelles, CRAS Paris Sér. A 271 (1970) 1171-1173.
22. [22] A. Seidenberg, Constructions in algebra, Trans. Amer. Math. Soc. 197 (1974) 273-313.
23. [23] W.V. Vasconcelos, Jacobian matrices and constructions in algebra, Proc. AAECC-9, New Orleans, LA, USA, October 1991, Lecture Notes in Computer Science, Vol. 539 (Springer, Berlin, 1991) 48-64.