Computing the homology of semialgebraic sets. II: General formulas
From MaRDI portal
Publication:2052718
DOI10.1007/s10208-020-09483-8zbMath1492.14103arXiv1903.10710OpenAlexW2922936069MaRDI QIDQ2052718
Felipe Cucker, Peter Bürgisser, Josué Tonelli-Cueto
Publication date: 26 November 2021
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.10710
Related Items (6)
Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ On the complexity of the Plantinga-Vegter algorithm ⋮ The critical curvature degree of an algebraic variety ⋮ Sampling and homology via bottlenecks ⋮ Persistent Homology of Semialgebraic Sets ⋮ Efficient simplicial replacement of semialgebraic sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the homology of real projective sets
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- A numerical algorithm for zero counting. I: Complexity and accuracy
- Topological stability of smooth mappings
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- Computing the homology of semialgebraic sets. I: Lax formulas
- Finding the homology of submanifolds with high confidence from random samples
- Numerical Instability of Resultant Methods for Multidimensional Rootfinding
- Condition
- Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Notes on Topological Stability
- Approximation of definable sets by compact families, and upper bounds on homotopy and homology
This page was built for publication: Computing the homology of semialgebraic sets. II: General formulas
