TU Berlin

Fachgebiet Algorithmische AlgebraDr. Pierre Lairez

Page Content

to Navigation

Ehemalige Mitarbeiter

Dr. Pierre Lairez


INRIA Saclay Île-de-France, Bât. Alan Turing
1 rue Honoré d'Estienne d'Orves
Campus de l'École polytechnique
91120 Palaiseau
Persönliche Homepage

Publikationen in der Arbeitsgruppe

Computing the homology of basic semialgebraic sets in weak exponential time
Citation key CBL-Computing-The-Homology-Of-Basic-Semialgebraic-Sets-In-Weak-Exponential-Time
Author Felipe Cucker and Peter Bürgisser and Pierre Lairez
Year 2019
DOI 10.1145/3275242
Journal Journal of the Association for Computing Machinery
Volume 66
Number 1
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).
Link to publication Link to original publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe