Computing the homology of basic semialgebraic sets in weak exponential time

06/22/2017

∙

by   Felipe Cucker, et al.

∙

0

∙

share

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).