TU Berlin

Fachgebiet Algorithmische AlgebraDr. Pierre Lairez

Inhalt des Dokuments

zur Navigation

Ehemalige Mitarbeiter

Dr. Pierre Lairez

Lupe

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

Publikationen in der Arbeitsgruppe

Computing the homology of basic semialgebraic sets in weak exponential time
Zitatschlüssel CBL-Computing-The-Homology-Of-Basic-Semialgebraic-Sets-In-Weak-Exponential-Time
Autor Felipe Cucker and Peter Bürgisser and Pierre Lairez
Jahr 2017
Monat 06
Notiz To appear in J. ACM.
Zusammenfassung 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 zur Publikation Download Bibtex Eintrag

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe