TU Berlin

Fachgebiet Algorithmische AlgebraPreprints

Inhalt des Dokuments

zur Navigation


Computing the Homology of Semialgebraic Sets. II: General formulas
Zitatschlüssel BCT-Computing-the-Homology-of-Semialgebraic-Sets-II:-General-Formulas
Autor Peter Bürgisser and Felipe Cucker and Josué Tonelli-Cueto
Jahr 2019
Monat 03
Zusammenfassung We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a subset of data having exponentially small measure, the cost of the algorithm is single exponential in the size of the data. This extends the previous work of the authors in arXiv:1807.06435 to arbitrary semialgebraic sets. All previous algorithms proposed for this problem have doubly exponential complexity (and this is so for almost all input data).
Link zur Publikation Download Bibtex Eintrag



Schnellnavigation zur Seite über Nummerneingabe