The complexity of stratification computation (Q1380787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1127615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of stratification computation |
scientific article; zbMATH DE number 1127615 |
Statements
The complexity of stratification computation (English)
0 references
22 April 1998
0 references
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.
0 references
stratification of semialgebraic sets
0 references
0.827814519405365
0 references
