This paper investigates the complexity of stratification computation for semialgebraic sets. An upper bound for the computation of canonical stratification.

This paper investigates the complexity of stratification computation for semialgebraic sets. An upper bound for the computation of canonical stratifications ...

This paper investigates the complexity of stratification computation for semialgebraic sets. An upper bound for the computation of canonical stratifications ...

The complexity (running time) of the stratification algorithm is explicitly estimated in terms of the format of the input semi-Pfaffian set. This also implies ...

It is possible to compute the canonical Whitney stratification of an algebraic set X of Cn in sequential time doubly exponential in m, the number of ...

The computation is finite if α is finite; otherwise it is infinite. We say that the computation starts at σ0. The computation halts if α is finite and there.

The computation is finite if α is finite; otherwise it is infinite. We say that the computation starts at σ0. The computation halts if α is finite and there.

The class of locally stratified logic programs is shown to be Pi-1-1 complete by the construction of a reducibility of the class of infinitely branching ...

2024/07/28 · ABSTRACT. We descrive two new algorithms for the computation of Whitney stratifications of real and complex algebraic varieties.

An explicit estimate of the complexity of the algorithm and of the resulting stratification is given, in terms of the parameters of the Pfaffian functions ...