Abstract
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).
- D. Amelunxen and M. Lotz. 2017. Average-case complexity without the black swans. J. Complex. 41 (2017), 82--101.Google ScholarCross Ref
- S. Basu. 2008. Algorithmic semi-algebraic geometry and topology—recent progress and open problems. In Surveys on Discrete and Computational Geometry. Contemp. Math., Vol. 453. American Mathematical Society, Providence, RI, 139--212.Google Scholar
- S. Basu. 2008. Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time. Found. Comput. Math. 8 (2008), 45--80.Google ScholarDigital Library
- S. Basu, R. Pollack, and M.-F. Roy. 1999. Computing roadmaps of semi-algebraic sets on a variety. J. Am. Math. Soc. 33 (1999), 55--82.Google Scholar
- S. Basu, R. Pollack, and M.-F. Roy. 2006. Computing the dimension of a semi-algebraic set. J. Math. Sci. 134, 5 (2006), 2346--2353.Google ScholarCross Ref
- S. Basu, Richard Pollack, and Marie-Françoise Roy. 2005. Computing the first Betti number and the connected components of semi-algebraic sets. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC ’05). ACM, New York, NY, 304--312. Google ScholarDigital Library
- S. Basu, R. Pollack, and M.-F. Roy. 1996. On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43 (1996), 1002--1045. Google ScholarDigital Library
- S. Basu, M.-F. Roy, M. Safey El Din, and É Schost. 2014. A baby step--giant step roadmap algorithm for general algebraic sets. Found. Comput. Math. 14, 6 (2014), 1117--1172. Google ScholarDigital Library
- S. Basu. 2006. Computing the first few Betti numbers of semi-algebraic sets in single exponential time. J. Symbol. Comput. 41, 10 (2006), 1125--1154.Google ScholarCross Ref
- S. Basu. 1996. On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing. ACM, 408--417. Google ScholarDigital Library
- S. Basu, R. Pollack, and M.-F. Roy. 2008. Computing the first Betti number of a semi-algebraic set. Found. Comput. Math. 8, 1 (2008), 97--136.Google ScholarDigital Library
- A. Björner. 1995. Topological methods. In Handbook of Combinatorics, R. Graham, M. Grotschel, and L. Lovasz (Eds.). North-Holland, Amsterdam, 1819--1872. Google ScholarDigital Library
- Lenore Blum, Michael Shub, and Steve Smale. 1989. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21, 1 (1989), 1--46.Google ScholarCross Ref
- A. Borodin. 1977. On relating time and space to size and depth. SIAM J. Comp. 6 (1977), 733--744.Google ScholarCross Ref
- Nicolas Bourbaki. 2004. Functions of a Real Variable. Springer-Verlag, Berlin.Google Scholar
- Morton Brown. 1962. Locally flat imbeddings of topological manifolds. Ann. Math. (2) 75 (1962), 331--341.Google ScholarCross Ref
- P. Bürgisser, M. Clausen, and A. Shokrollahi. 1996. Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, Vol. 315. Springer-Verlag.Google Scholar
- P. Bürgisser and F. Cucker. 2013. Condition. Grundlehren der mathematischen Wissenschaften, Vol. 349. Springer-Verlag, Berlin.Google Scholar
- J. F. Canny. 1991. Computing roadmaps of general semi-algebraic sets. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Lecture Notes in Computer Science). Springer, Berlin, Heidelberg, 94--107. Google ScholarDigital Library
- J. Canny, D. Yu. Grigorev, and N. N. Vorobjov, Jr.1992. Finding connected components of a semialgebraic set in subexponential time. Appl. Algebra Engrg. Comm. Comput. 2, 4 (1992), 217--238. Google ScholarDigital Library
- John Canny. 1993. Computing roadmaps of general semi-algebraic sets. Comput. J. 36 (1993), 504--514.Google ScholarCross Ref
- Frédéric Chazal, David Cohen-Steiner, and André Lieutier. 2009. A sampling theory for compact sets in Euclidean space. Discr. Comput. Geom. 41, 3 (2009), 461--479.Google ScholarDigital Library
- G.E. Collins. 1975. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Deccomposition. Lect. Notes Comp. Sci., Vol. 33. Springer-Verlag, 134--183. Google ScholarDigital Library
- Robert Connelly. 1971. A new proof of Brown’s Collaring theorem. Proc. Am. Math. Soc. 27, 1 (1971), 180.Google Scholar
- F. Cucker. 1999. Approximate zeros and condition numbers. J. Complex. 15 (1999), 214--226. Google ScholarDigital Library
- F. Cucker, T. Krick, G. Malajovich, and M. Wschebor. 2008. A numerical algorithm for zero counting. I: Complexity and accuracy. J. Complex. 24 (2008), 582--605. Google ScholarDigital Library
- F. Cucker, T. Krick, G. Malajovich, and M. Wschebor. 2009. A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis. J. Fixed Point Theory Appl. 6 (2009), 285--294.Google ScholarCross Ref
- F. Cucker and S. Smale. 1999. Complexity estimates depending on condition and round-off error. J. ACM 46 (1999), 113--184. Google ScholarDigital Library
- Felipe Cucker, Teresa Krick, and Michael Shub. 2018. Computing the homology of real projective sets. Found. Comput. Math. 18, 4 (2018), 929--970. Google ScholarCross Ref
- Jean-Pierre Dedieu. 2006. Points Fixes, Zéros et La Méthode de Newton. Mathématiques 8 Applications, Vol. 54. Springer.Google Scholar
- H. Edelsbrunner. 1995. The union of balls and its dual shape. Discr. Comput. Geom. 13, 3 (1995), 415--440. Google ScholarDigital Library
- H. Edelsbrunner and N. R. Shah. 1992. Incremental topological flipping works for regular triangulations. ACM Press, 43--52. Google ScholarDigital Library
- Herbert Edelsbrunner and Ernst P. Mücke. 1994. Three-dimensional alpha shapes. ACM Trans. Graph. 13, 1 (Jan. 1994), 43--72. Google ScholarDigital Library
- Herbert Federer. 1959. Curvature measures. Trans. Am. Math. Soc. 93, 3 (1959), 418--491.Google ScholarCross Ref
- Israel M. Gelfand, Mikhail M. Kapranov, and Andrei V. Zelevinsky. 1994. Discriminants, Resultants, and Multidimensional Determinants. Birkhäuser Boston Inc., Boston, MA.Google Scholar
- Gene H. Golub and Victor Pereyra. 1973. The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM J. Numer. Anal. 10, 2 (1973), 413--432.Google ScholarDigital Library
- D. Yu. Grigor’ev and N. N. Vorobjov. 1988. Solving systems of polynomial inequalities in subexponential time. J. Symbol. Comput. 5, 1 (1988), 37--64. Google ScholarDigital Library
- D.Yu. Grigoriev and N.N. Vorobjov. 1992. Counting connected components of a semialgebraic set in subexponential time. Comput. Complex. 2 (1992), 133--186. Google ScholarDigital Library
- Joos Heintz, Marie-Françoise Roy, and Pablo Solernó. 1994. Single exponential path finding in semi-algebraic sets. II. The general case. In Algebraic Geometry and Its Applications. Springer, New York, 449--465.Google Scholar
- M.R. Hestenes and E. Stiefel. 1952. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49 (1952), 409--436 (1953).Google ScholarCross Ref
- P. Koiran. 1999. The real dimension problem is NP<sub>R</sub>-complete. J. Complex. 15 (1999), 227--238. Google ScholarDigital Library
- E. Kostlan. 1988. Complexity theory of numerical linear algebra. J. Comput. Appl. Math. 22 (1988), 219--230. Google ScholarDigital Library
- Pierre Lairez. 2017. Rigid Continuation Paths I. Quasilinear Average Complexity for Solving Polynomial Systems. arxiv:1711.03420Google Scholar
- Alexander Morgan and Andrew Sommese. 1987. A homotopy for solving general polynomial systems that respects m-homogeneous structures. Appl. Math. Comput. 24, 2 (1987), 101--113. Google ScholarDigital Library
- D. Mumford. 1976. Algebraic Geometry I, Complex Projective Varieties. Springer-Verlag.Google Scholar
- I. P. Natanson. 1955. Theory of Functions of a Real Variable. Frederick Ungar Publishing Co., New York, NY.Google Scholar
- J. von Neumann and H. H. Goldstine. 1947. Numerical inverting matrices of high order. Bull. Am. Math. Soc. 53 (1947), 1021--1099.Google ScholarCross Ref
- P. Niyogi, S. Smale, and S. Weinberger. 2008. Finding the homology of submanifolds with high confidence from random samples. Discr. Comput. Geom. 39 (2008), 419--441. Google ScholarDigital Library
- J. Renegar. 1992. On the computational complexity and geometry of the first-order theory of the reals. Part I.J. Symbol. Comput. 13 (1992), 255--299. Google ScholarDigital Library
- Mohab Safey El Din and Éric Schost. 2017. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. J. ACM 63, 6 (2017), 48:1--48:37. Google ScholarDigital Library
- P. Scheiblechner. 2012. Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties. Found. Comput. Math. 12 (2012), 541--571. Google ScholarDigital Library
- P. Scheiblechner. 2007. On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety. J. Complex. 23 (2007), 359--379. Google ScholarDigital Library
- I. R. Shafarevich. 1994. Basic Algebraic Geometry. 1: Varieties in Projective Space (2 Ed.). Springer-Verlag. Google ScholarDigital Library
- M. Shub and S. Smale. 1993. Complexity of Bézout’s theorem I: Geometric aspects. J. Am. Math. Soc. 6 (1993), 459--501.Google Scholar
- M. Shub and S. Smale. 1993. Complexity of Bézout’s theorem II: Volumes and probabilities. In Computational Algebraic Geometry (Progress in Mathematics), F. Eyssette and A. Galligo (Eds.), Vol. 109. Birkhäuser, 267--285.Google Scholar
- M. Shub and S. Smale. 1993. Complexity of Bézout’s theorem III: Condition number and packing. J. Complex. 9 (1993), 4--14. Google ScholarDigital Library
- M. Shub and S. Smale. 1996. Complexity of Bézout’s theorem IV: Probability of success; extensions. SIAM J. Numer. Anal. 33 (1996), 128--148. Google ScholarDigital Library
- M. Shub and S. Smale. 1994. Complexity of Bézout’s theorem V: Polynomial time. Theoret. Comp. Sci. 133 (1994), 141--164. Google ScholarDigital Library
- S. Smale. 1997. Complexity theory and numerical analysis. In Acta Numerica, A. Iserles (Ed.). Cambridge University Press, 523--551.Google Scholar
- Steve Smale. 1986. Newton’s method estimates from data at one point. In The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics. Springer, New York, 185--196.Google Scholar
- A. M. Turing. 1948. Rounding-off errors in matrix processes. Quart. J. Mech. Appl. Math. 1 (1948), 287--308.Google ScholarCross Ref
- H. R. Wüthrich. 1976. Ein Entscheidungsverfahren für die Theorie der reell-abgeschlossenen Körper. In Komplexität von Entscheidungsproblemen (Lect. Notes Comp. Sci.), E. Specker and V. Strassen (Eds.), Vol. 43. Springer-Verlag, 138--162. Google ScholarDigital Library
Index Terms
Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time
Recommendations
Enriched homology and cohomology modules of simiplicial complexes
For a simplicial complex Δ on {1, 2, , n } we define enriched homology and cohomology modules. They are graded modules over k [ x 1 , , x n ] whose ranks are equal to the dimensions of the reduced homology and cohomology groups.
We ...
Computing homology groups of simplicial complexes in R3
Recent developments in analyzing molecular structures and representing solid models using simplicial complexes have further enhanced the need for computing structural information about simplicial complexes in R3. This paper develops basic techniques ...
Measuring and computing natural generators for homology groups
We develop a method for measuring homology classes. This involves two problems. First, we define the size of a homology class, using ideas from relative homology. Second, we define an optimal basis of a homology group to be the basis whose elements' ...
Comments