Complexity of cylindrical decompositions of sub-Pfaffian
From MaRDI portal
Publication:5951564
DOI10.1016/S0022-4049(00)00149-3zbMath0994.32006OpenAlexW2116043583MaRDI QIDQ5951564
Andrei Gabrielov, Nikolaj N. jun. Vorob'ev
Publication date: 10 October 2002
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-4049(00)00149-3
Symbolic computation and algebraic computation (68W30) Semi-analytic sets, subanalytic sets, and generalizations (32B20) Model theory of ordered structures; o-minimality (03C64)
Related Items (6)
Multiplicities of Noetherian deformations ⋮ An unfeasibility view of neural network learning ⋮ Uniformization in superstructures over some extensions of \(\mathbb{R}\) ⋮ Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) ⋮ Zero counting for a class of univariate Pfaffian functions ⋮ Computing combinatorial types of trajectories in Pfaffian dynamics
Cites Work
- \(p\)-adic and real subanalytic sets
- Solving systems of polynomial inequalities in subexponential time
- The complexity of deciding consistency of systems of polynomials in exponent inequalities
- Betti numbers of semi-Pfaffian sets
- The elementary theory of restricted analytic fields with exponentiation
- Frontier and closure of a semi-Pfaffian set
- Complexity of stratifications of semi-Pfaffian sets
- Complements of subanalytic sets and existential formulas for analytic functions
- Projections of semi-analytic sets
- On the Covering of Analytic Loci by Complexes
- On the combinatorial and algebraic complexity of quantifier elimination
- Geometric and differential properties of subanalytic sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity of cylindrical decompositions of sub-Pfaffian