Complexity of computing the local dimension of a semialgebraic set

DOI10.1006/jsco.1999.0282zbMath0986.14036OpenAlexW2002314756MaRDI QIDQ1300630

Nikolaj N. jun. Vorob'ev

Publication date: 18 July 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1999.0282

zbMATH Keywords

stratificationcomplexityglobal dimensionsemialgebraic setlocal dimensionquantifier free formulasemialgebraic variety

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (2)

Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers ⋮ Smooth points on semi-algebraic sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
• Solving systems of polynomial inequalities in subexponential time
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Complexity of deciding Tarski algebra
• Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
• The complexity of stratification computation
• Sur la complexité du principe de Tarski-Seidenberg
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Complexity of computing the local dimension of a semialgebraic set