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: Thursday, October 16, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Antonis Thomas

The Complexity of Searching for a Solution

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.

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