The complexity of stratification computation

DOI10.1007/PL00009335zbMath0928.14037OpenAlexW2001269450MaRDI QIDQ1380787

E. Rannou

Publication date: 22 April 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009335

zbMATH Keywords

stratification of semialgebraic sets

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Computational aspects in algebraic geometry (14Q99)

Related Items (5)

The landscape of G-structures in eight-manifold compactifications of M-theory ⋮ Conormal spaces and Whitney stratifications ⋮ On irreducible components of real exponential hypersurfaces ⋮ Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets ⋮ Complexity of computing the local dimension of a semialgebraic set

This page was built for publication: The complexity of stratification computation