Computing the Homology of Semialgebraic Sets. II: General formulas - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Foundations of Computational Mathematics Year : 2021

Computing the Homology of Semialgebraic Sets. II: General formulas

Abstract

We describe and analyze a numerical 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 work in Part I to arbitrary semialgebraic sets. All previous algorithms proposed for this problem have doubly exponential complexity .
Fichier principal
Vignette du fichier
Computing_the_Homology_of_Semialgebraic_Sets__II__General_Case.pdf (528.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02878370 , version 1 (23-06-2020)

Identifiers

Cite

Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto. Computing the Homology of Semialgebraic Sets. II: General formulas. Foundations of Computational Mathematics, 2021, ⟨10.1007/s10208-020-09483-8⟩. ⟨hal-02878370⟩
57 View
183 Download

Altmetric

Share

Gmail Facebook X LinkedIn More