Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time

DOI10.1145/3275242zbMath1426.14016arXiv1706.07473OpenAlexW3123452453WikidataQ115522537 ScholiaQ115522537MaRDI QIDQ4625671

Peter Bürgisser, Pierre Lairez, Felipe Cucker

Publication date: 25 February 2019

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.07473

zbMATH Keywords

algorithmhomologysemialgebraic geometry

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (14)

Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ On the complexity of the Plantinga-Vegter algorithm ⋮ Computing Geometric Feature Sizes for Algebraic Manifolds ⋮ Sampling and homology via bottlenecks ⋮ Persistent Homology of Semialgebraic Sets ⋮ Efficient simplicial replacement of semialgebraic sets ⋮ The persistent topology of optimal transport based metric thickenings ⋮ Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions ⋮ Unnamed Item ⋮ Learning algebraic varieties from samples ⋮ Computing the homology of semialgebraic sets. I: Lax formulas ⋮ Computing the homology of semialgebraic sets. II: General formulas ⋮ Smoothed analysis for the condition number of structured real polynomial systems ⋮ Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets

This page was built for publication: Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time