Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities
From MaRDI portal
Publication:862342
DOI10.1007/s00037-006-0214-5zbMath1103.14032OpenAlexW1988648010MaRDI QIDQ862342
Publication date: 24 January 2007
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-006-0214-5
Analysis of algorithms and problem complexity (68Q25) Semialgebraic sets and related spaces (14P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Topology of real algebraic varieties (14P25)
Related Items (4)
A sharper estimate on the Betti numbers of sets defined by quadratic inequalities ⋮ On projections of semi-algebraic sets defined by few quadratic inequalities ⋮ 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
This page was built for publication: Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities
