Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
From MaRDI portal
Publication:1024388
DOI10.1016/j.jalgebra.2008.09.043zbMath1171.14040arXiv0806.3911OpenAlexW2001918102WikidataQ56859918 ScholiaQ56859918MaRDI QIDQ1024388
Marie-Françoise Roy, Saugata Basu, Dimitrii V. Pasechnik
Publication date: 17 June 2009
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.3911
triangulationinfinitesimal elementsBetti numbersreal closed fieldsemi-algebraic setscell complexquadratic inequalities
Semialgebraic sets and related spaces (14P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Topology of real algebraic varieties (14P25)
Related Items
Bounding the equivariant Betti numbers of symmetric semi-algebraic sets, Geodesic diameter of sets defined by few quadratic equations and inequalities, Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets, Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials, A complexity theory of constructible functions and sheaves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials
- Counting connected components of a semialgebraic set in subexponential time
- On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
- Construction of roadmaps in semi-algebraic sets
- Description of the connected components of a semialgebraic set in single exponential time
- On the Betti numbers of semialgebraic sets defined by few quadratic inequalities
- Betti numbers of semialgebraic sets defined by quantifier-free formulae
- Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
- Feasibility testing for systems of real quadratic equations
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time
- Topology of quadratic maps and Hessians of smooth maps
- Computing Roadmaps of General Semi-Algebraic Sets
- A Vietoris Mapping Theorem for Homotopy
- Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems
- Computing roadmaps of semi-algebraic sets on a variety
- On the Betti Numbers of Real Varieties
- Algorithms in real algebraic geometry