Computing the Euler-Poincaré characteristics of sign conditions
From MaRDI portal
Publication:1781115
DOI10.1007/S00037-005-0190-1zbMATH Open1077.14086OpenAlexW1964303164MaRDI QIDQ1781115FDOQ1781115
Marie-Françoise Roy, Richard Pollack, Saugata Basu
Publication date: 16 June 2005
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-005-0190-1
Cited In (7)
- A complexity theory of constructible functions and sheaves
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time
- Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
- Persistent Homology of Semialgebraic Sets
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
This page was built for publication: Computing the Euler-Poincaré characteristics of sign conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781115)