Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
On The Connectivity and Topology of Semi-algebraic Sets: Complexity and
Algorithms
Saugata Basu, University of Michigan
In this talk I will survey old and new results on deciding connectivity and other topological properties of semi-algebraic sets. I will describe new algorithms for obtaining semi-algebraic descriptions of the connected components of semi-algebraic sets. I will also describe some recently discovered connections between problems of bounding the combinatorial complexity of arrangements and the topological complexity of semi-algebraic sets.
Back
