Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
From MaRDI portal
Publication:6624170
DOI10.1007/s00454-024-00626-0MaRDI QIDQ6624170
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Classical real and complex (co)homology in algebraic geometry (14F25) Semialgebraic sets and related spaces (14P10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Divide and conquer roadmap for algebraic sets
- A baby step-giant step roadmap algorithm for general algebraic sets
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Computing the first Betti number of a semi-algebraic set
- Solving systems of polynomial inequalities in subexponential time
- Counting connected components of a semialgebraic set in subexponential time
- On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
- Construction of roadmaps in semi-algebraic sets
- On computing a set of points meeting every cell defined by a family of polynomials on a variety
- Computing the Euler-Poincaré characteristics of sign conditions
- Computing the homology of semialgebraic sets. II: General formulas
- Computing the homology of semialgebraic sets. I: Lax formulas
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time
- Computing Roadmaps of General Semi-Algebraic Sets
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Constructible Sheaves
- Volume-Optimal Cycle: Tightest Representative Cycle of a Generator in Persistent Homology
- Algorithms in Real Algebraic Geometry: A Survey
- Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time
- Computing roadmaps of semi-algebraic sets on a variety
- Computing Minimal Persistent Cycles: Polynomial and Hard Cases
- On the Betti Numbers of Real Varieties
- Algorithms in real algebraic geometry
- Persistent Homology of Semialgebraic Sets
- Efficient simplicial replacement of semialgebraic sets
This page was built for publication: Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624170)