Abstract
It is possible to compute the canonical Whitney stratification of an algebraic set X of Cn in sequential time doubly exponential in m, the number of nonempty sets in the filtration associated with the canonical Whitney stratification. By the usual identification of C and R2, stratifying X can be seen as a semialgebraic problem. Each stratum of the canonical Whitney stratification of X is so described by means of a formula of the elementary language of ordered fields with 2n free variables. Degree and number of the polynomials appearing in these formulas is of order doubly exponential in m.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.BOCHNAK, M.COSTE et M.F. ROY: Géometrie algébrique réelle, Springer-Verlag (1987)
J.CANNY, D.GRIGOR'EV, N.VOROBJOV: Finding connected components of a semialgebraic set in subexponential time, mamuscrit L.O.M.I., Steklov Institute of Leningrad (1990)
D. GRIGOR'EV: Complexity of deciding Tarski algebra J. Symbolic Computation 5 (1988) 65–108
D. GRIGOR'EV, J. HEINTZ, M.F. ROY, P. SOLERNO, N. VOROBJOV: Comptage des composantes connexes d'un ensemble semi-algébrique en temps simplement exponentiel Compte-rendus de l'académie des sciences Paris 311 879–882 (1990).
D. GRIGOR'EV, N. VOROBJOV: Solving systems of polynomial inequalities in subexponentional time J. Symbolic Computation 5 (1988) 37–64
J. HEINTZ, M.F. ROY, P. SOLERNO: Sur la complexité du principe de Tarski-Seidenberg Bulletin de la société mathématique de France 118, 1990 p101–126
J.HEINTZ, M.F.ROY, P.SOLERNO: Description of the connected components of a semi-algebraic set in singly exponentional time. Manuscrit, IRMAR, Université de Rennes (1991).
J.RENEGAR: On the computational complexity and geometry of the first order theory of the reals Technical Report 825, Cornell University Ithaca (1989)
B.TEISSIER: Variétés polaires 2: Multiplicités polaires, sections planes, et conditions de Whitney Actes de la conférence de géométrie algébrique à La Ràbida, 1981, Springer Lecture Notes 961, p.314–491.
J. VON ZUR GATHEN: Parallel arithmetic computations: a survey Proc. 13th Symp. MFCS 1986, Springer LN Comput.Sci. 233 (1986) 93–112.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mostowski, T., Rannou, E. (1991). Complexity of the computation of the canonical Whitney stratification of an algebraic set in Cn . 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_117
Download citation
DOI: https://doi.org/10.1007/3-540-54522-0_117
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