Computation of real radicals of polynomial ideals. II (Q1380019): Difference between revisions

This paper is a sequel to the part I of this work of [\textit{E. Becker} and \textit{R. Neuhaus} in: Computational algebraic geometry, Pap. Conf., Nice 1992, Prog. Math. 109, 1-20 (1993; Zbl 0804.13010)] where an algorithm for the computation of the real radical was published. In this paper the author presents this algorithm in a revised form together with more background material. The issue of complexity is dealt with and further theoretical and algorithmical studies are included. The author describes an algorithm for the computation of real radicals of polynomial ideals. The paper contains the sections of real radicals, complexity, computational aspects of the open-mapping theorem, and variation of orderings after an introductional section.