Computing the homology of basic semialgebraic sets in weak exponential time

Abstract

We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of data the cost of the algorithm is exponential in the size of the data. All algorithms previously proposed for this problem have a complexity which is doubly exponential (and this is so for almost all data).

Cited by in corpus (8)

• Computing the Homology of Semialgebraic Sets. II: General formulas
• Computing the Homology of Semialgebraic Sets I: Lax Formulas
• Computing the volume of compact semi-algebraic sets
• Plantinga-Vegter algorithm takes average polynomial time
• Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
• On the Complexity of the Plantinga-Vegter Algorithm
• The Persistent Topology of Optimal Transport Based Metric Thickenings
• Finding the Homology of Manifolds using Ellipsoids