Combinatorial complexity in o-minimal geometry

DOI10.1112/plms/pdp031zbMath1186.52017arXivmath/0612050OpenAlexW3101940668MaRDI QIDQ5190312

Saugata Basu

Publication date: 15 March 2010

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

arrangementsalgebraic complexitysemi-algebraic setscell decompositionssemi-Pfaffian setstopological complexity of projections

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Semialgebraic sets and related spaces (14P10) Combinatorial complexity of geometric structures (52C45)

Related Items (6)

Structure and regularity for subsets of groups with finite VC-dimension ⋮ Cohomology of algebraic varieties over non-archimedean fields ⋮ Bounds of Hausdorff measures of tame sets ⋮ RAMSEY GROWTH IN SOME NIP STRUCTURES ⋮ On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms ⋮ VC density of definable families over valued fields

This page was built for publication: Combinatorial complexity in o-minimal geometry