The complexity of stratification computation
From MaRDI portal
The paper studies the complexity of an algorithm that stratifies semialgebraic sets. It gives a general theorem on the complexity of an algorithm which constructs a stratification for a wide class of conditions, called here admissible. The algorithm is doubly exponential in the depth of the stratification. Usual conditions of regularity like Whitney conditions (a) and (b) or Bekka condition (C) are admissible.
Recommendations
Cited in
(15)- Complexity of computing the local dimension of a semialgebraic set
- On irreducible components of real exponential hypersurfaces
- Weak Wu stratification in \(\mathbb{R}^n\)
- Complexity of stratifications of semi-Pfaffian sets
- Local cohomology and stratification
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- The landscape of G-structures in eight-manifold compactifications of M-theory
- scientific article; zbMATH DE number 177498 (Why is no real title available?)
- scientific article; zbMATH DE number 177882 (Why is no real title available?)
- Conormal spaces and Whitney stratifications
- Faster computation of Whitney stratifications and their minimization
- Riso-stratifications and a tree invariant
- Whitney stratification of algebraic boundaries of convex semi-algebraic sets
- Computing the complexity for Schelling segregation models
- Stratification of projection maps from toric varieties
This page was built for publication: The complexity of stratification computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380787)
