Efficient simplicial replacement of semialgebraic sets
From MaRDI portal
Publication:6103446
DOI10.1017/fms.2023.36zbMath1516.14106arXiv2009.13365OpenAlexW4378473723MaRDI QIDQ6103446
Publication date: 5 June 2023
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.13365
Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Homotopy theory and fundamental groups in algebraic geometry (14F35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cohomology of sheaves
- Computing the first Betti number of a semi-algebraic set
- Counting connected components of a semialgebraic set in subexponential time
- A Vietoris-Begle theorem for connective Steenrod homology theories and cell-like maps between metric compacta
- Betti numbers of semialgebraic sets defined by quantifier-free formulae
- Computing the homology of semialgebraic sets. II: General formulas
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
- Computing the homology of semialgebraic sets. I: Lax formulas
- Extension spaces of oriented matroids
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time
- Sur les théorèmes de de Rham
- Computing Roadmaps of General Semi-Algebraic Sets
- A Vietoris Mapping Theorem for Homotopy
- On the algorithmic insolvability of the word problem in group theory
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Algorithms in Real Algebraic Geometry: A Survey
- Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time
- Poset fiber theorems
- Computing roadmaps of semi-algebraic sets on a variety
- Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
- Homotopy Type Comparison of a Space with Complexes Associated with its Open Covers
This page was built for publication: Efficient simplicial replacement of semialgebraic sets
