Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Wednesday, June 22, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Martin Tancer (Charles Univ.)

Good covers are algorithmically unrecognizable

ood cover in d-dimensional Euclidean space is a finite collection of open sets homeomorphic to a d-ball such that the intersection of any nonempty subcollection is either empty or again homeomorphic to a d-ball. Good covers generalize collections of convex sets and their possible intersection patterns have been intensively studied in terms of necessary conditions.

The main result presented in the talk is that it is actually algorithmically undecidable to recognize whether a given "pattern" is an intersection pattern of a good cover.

Joint work with D. Tonkonog.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login