Sciweavers

STOC
2007
ACM
108views Algorithms» more  STOC 2007»
14 years 5 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu