Complexity of Stratications of Semi-Pfaan Sets
Andrei M. Gabrielov, Nicolai Vorobjov · 1994
An eective algorithm for a smooth (weak) stratication of a real semi-Pfaan set is suggested, provided an oracle deciding consistency of a system of Pfaan equations and inequalities is given. An explicit estimate of complexity of the algorithm and of the resulting stratication is given, in terms of the parameters of the Pfaan functions dening the original semi- Pfaan set. The algorithm is applied to sets dened by sparse polynomials and exponential polynomials.