Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Tuesday, April 01, 2025, 12:15 pm
Duration: 30 minutes
Location: OAT S15
Speaker: Sebastian Haslebacher
Simple Stochastic Games (SSG) and ARRIVAL are two problems that are both known to lie in NP and CoNP, but for which we do not know of any polynomial-time algorithms. In this talk, I will explain how both problems reduce to finding an approximate fixpoint of an l_p-contraction map. In the case of SSG, this result is due to Condon and the resulting map is contracting with respect to the l_\infty-metric. The reduction for ARRIVAL is new and yields a contraction map with respect to the l_1-metric. With this talk I hope to motivate the study of l_p-contractions in general, a problem that Simon will tell you more about on Thursday.
Upcoming talks | All previous talks | Talks by speaker |
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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