Complexity of Computing the Local Dimension of a Semialgebraic Set

The paper describes several algorithms related to a problem of computing the local dimension of a semialgebraic set. Let a semialgebraic set V be defined by a system of k inequalities of the formf? 0 with f?RX1,? ,Xn , deg(f)

[1]  E. Rannou,et al.  The Complexity of Stratification Computation , 1998, Discret. Comput. Geom..

[2]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[3]  D. Grigor'ev.  Complexity of deciding Tarski algebra , 1988 .

[4]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[5]  Alexander L. Chistov,et al.  Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic , 1997 .

[6]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[7]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[8]  D. Grigor'ev,et al.  Factorization of polynomials over a finite field and the solution of systems of algebraic equations , 1986 .

[9]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[10]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[11]  M-F Roy,et al.  Géométrie algébrique réelle , 1987 .

[12]  I. Shafarevich.  Basic algebraic geometry , 1974 .

[13]  Joos Heintz,et al.  Sur la complexité du principe de Tarski-Seidenberg , 1989 .

[14]  Alexander L. Chistov,et al.  Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic , 1996, J. Symb. Comput..

[15]  M. Goresky,et al.  Stratified Morse theory , 1988 .