Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 16, 2014, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Antonis Thomas
I will give a short introduction to some complexity classes that capture the difficulty of searching for a solution. These, have been defined by Johnson, Papadimitriou and Yannakakis, starting in the mid-80s. By now, some of them (e.g. PPAD and PLS) have received considerable attention from the computer science community. The talk will serve as a tutorial, giving the definitions of these classes and naming some relevant search problems. Personally, the motivation for studying these classes comes from my effort to characterize the complexity of the search problem "Find the sink of a Unique Sink Orientation". Depending on time, I will mention a couple of observations regarding this.
Automatic MiSe System Software Version 1.4803M | admin login