Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Friday, November 22, 2013, 12:15 pm
Duration: 30 minutes
Location: CAB G11
Speaker: Uli Wagner (Institute of Science and Technology Austria)
A classical result on the computational complexity of topological problems is that there is no algorithm to decide whether a given closed loop inside a given "shape" can be contracted to a single point without ever leaving the shape (more formally, it is undecidable whether a given element of the fundamental group of a given space is trivial).
In this talk, we will give a gentle introduction to a family of algorithmic questions of the same flavor, namely concerning the classification, up to continuous deformation, of continuous maps from one space into another. It turns out that for these questions there is a sharp "phase transition" between polynomiality and undecidability: on the one hand, under suitable hypothesis these questions can be solved in polynomial time, but if these hypotheses are slightly relaxed, the questions become undecidable.
This will be a survey on recent joint with Čadek, Krčál, Matoušek, Sergeraert, and Vokřínek.
Automatic MiSe System Software Version 1.4803M | admin login