Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time

@article{Cucker2019ComputingTH,
  title={Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time},
  author={Felipe Cucker and Peter B{\"u}rgisser and Pierre Lairez},
  journal={Journal of the ACM (JACM)},
  year={2019},
  volume={66},
  pages={1 - 30}
}
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets that works in weak exponential time. That is, 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 that is doubly exponential (and this is so for almost all data). 

Figures from this paper

Computing the Homology of Semialgebraic Sets. II: General Formulas
TLDR
A numerical algorithm for computing the homology of semialgebraic sets given by Boolean formulas works in weak exponential time, which 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.
Computing the Homology of Semialgebraic Sets. I: Lax Formulas
TLDR
An algorithm for computing the homology (Betti numbers and torsion coefficients) of closed semialgebraic sets given by Boolean formulas without negations over lax polynomial inequalities works in weak exponential time.
Condition and homology in semialgebraic geometry
TLDR
This PhD thesis shows how to obtain a numerical algorithm running in single exponential time with very high probability, which improves the state-of-the-art.
Persistent homology of semi-algebraic sets
TLDR
The algorithm is the first algorithm with singly exponential complexity for computing the barcodes up to dimension (cid:96) of a given semi-algebraic set by the sub-level sets of a Given polynomial.
Recent Advances in the Computation of the Homology of Semialgebraic Sets
TLDR
This article describes recent advances in the computation of the homology groups of semialgebraic sets and throws light on the main features of this technical picture, the complexity results obtained, and how the new algorithms fit into the landscape of existing results.
An Adaptive Grid Algorithm for Computing the Homology Group of Semialgebraic Set
TLDR
This thesis will introduce the improvement of an algorithm of weak exponential time for the computation of the homology groups of an algebraic set using an adaptive grid algorithm on the unit sphere.
An Adaptive Grid Algorithm for Computing the Homology Group of Semialgebraic Set
TLDR
This thesis will introduce the work on an improvement of this algorithm of weak exponential time using an adaptive grid algorithm on the unit sphere and the results will be compared to those of previous work on this topic.
Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
TLDR
An algorithm for computing a semi-algebraic basis for the first homology group, H1(S,F), with coefficients in a field F, of any given semi- algebraic set S ⊂ R defined by a closed formula is given, which generalizes well known algorithms having singly exponential complexity.
Computing the Volume of Compact Semi-Algebraic Sets
TLDR
An algorithm which takes as input a polynomial system defining S and an integer p and returns the n-dimensional volume of S at absolute precision 2^-p and improves upon the previous exponential bounds obtained by Monte-Carlo or moment-based methods.
Grid Methods in Computational Real Algebraic (and Semialgebraic) Geometry
TLDR
A family of numerical algorithms to solve problems in real algebraic and semialgebraic geometry that is radically different from the usual complexity analysis in symbolic computation as these numerical algorithms may run forever on a thin set of ill-posed inputs.
...
1
2
3
...

References

SHOWING 1-10 OF 76 REFERENCES
Computing the Homology of Real Projective Sets
TLDR
A numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties is described and it is shown that outside of an exceptional set of measure exponentially small in the size of the data, the algorithm takes exponential time.
Computing the First Betti Number of a Semi-Algebraic Set
TLDR
A singly exponential algorithm for computing the first Betti number of a given semi-algebraic set in singlyonential time is described, which improves on the complexity of the previously published algorithms for this problem.
Computing the first Betti number and the connected components of semi-algebraic sets
In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi-algebraic
On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
  • S. Basu
  • Mathematics, Computer Science
    STOC '96
  • 1996
TLDR
New bounds are proved on the sum of the Betti numbers of closed semi-algebraic sets and the first single exponential time algorithm for computing the Euler characteristic of arbitrary closed semi -al algebraic sets is given.
Counting connected components of a semialgebraic set in subexponential time
TLDR
An algorithm is exhibited which counts the number of connected components of the semialgebraic set in time (M (kd)n20)O (1) and allows us to determine whether any pair of points from the set are situated in the same connected component.
Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems
  • S. Basu
  • Mathematics, Computer Science
    ArXiv
  • 2007
We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti
Single Exponential Path Finding in Semi-algebraic Sets, Part II: The General Case
This paper is devoted to the following result. Let S be a semi-algebraic subset of R n ; one can decide in single exponential time whether two points of S belong to the same semi-algebraically
Castelnuovo–Mumford Regularity and Computing the de Rham Cohomology of Smooth Projective Varieties
TLDR
It is proposed that the Castelnuovo–Mumford regularity of the sheaf of differential p-forms on X is bounded by p(em+1)D, where e, m, and D are the maximal codimension, dimension, and degree of all irreducible components of X.
Computing the first few Betti numbers of semi-algebraic sets in single exponential time
  • S. Basu
  • Computer Science, Mathematics
    J. Symb. Comput.
  • 2006
...
1
2
3
4
5
...