On the polyhedral inapproximability of the SDP cone. In Delft last week which was absolutely great and I would like to thank Mirijam Dür. For the organization and providing us with such an inspirational atmosphere. On the complexity of polytopes and extended formulations. For a closed convex body.

The main area of research in this unit is the design and the analysis of efficient algorithms and data structures, especially for geomtric problems. Typical examples are computational problems involving higher-dimensional polyhedra, localizing query points amidst a very large number of geometric objects, and approximative geometric query answering. As ancillary subjects we also study combinatorial geometry and randomization. E 1 3, Room 409.

The main area of research in this unit is the design and the analysis of efficient algorithms and data structures, especially for geomtric problems. Typical examples are computational problems involving higher-dimensional polyhedra, localizing query points amidst a very large number of geometric objects, and approximative geometric query answering. As ancillary subjects we also study combinatorial geometry and randomization. E 1 3, Room 409.