Betti numbers of semialgebraic sets defined by quantifier-free formulae
From MaRDI portal
Publication:1773889
DOI10.1007/s00454-004-1105-7zbMath1073.14072OpenAlexW2159666017MaRDI QIDQ1773889
Andrei Gabrielov, Nikolaj N. jun. Vorob'ev
Publication date: 28 April 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-004-1105-7
Related Items (16)
On the Reeb spaces of definable maps ⋮ Topological lower bounds for arithmetic networks ⋮ Efficient simplicial replacement of semialgebraic sets ⋮ Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 ⋮ On homotopy types of limits of semi-algebraic sets and additive complexity of polynomials ⋮ Computing the first few Betti numbers of semi-algebraic sets in single exponential time ⋮ Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time ⋮ Computing the first Betti number of a semi-algebraic set ⋮ A sharper estimate on the Betti numbers of sets defined by quadratic inequalities ⋮ Bounds of Hausdorff measures of tame sets ⋮ Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications ⋮ Topological complexity of the relative closure of a semi-Pfaffian couple ⋮ On topological lower bounds for algebraic computation trees ⋮ Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials ⋮ Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials ⋮ Computing combinatorial types of trajectories in Pfaffian dynamics
This page was built for publication: Betti numbers of semialgebraic sets defined by quantifier-free formulae
