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: Tuesday, May 28, 2024, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Sebastian Haslebacher

Similarities between ARRIVAL and Simple Stochastic Games

The two problems ARRIVAL and Simple Stochastic Games (SSG) share the same complexity status: Both are known to lie in NP and coNP, but not known to belong to P. Besides this, it turns out that recent algorithms for both problems use similar ideas. Concretely, I will talk about similarities underlying the quasipolynomial-time algorithm for SSG on graphs of bounded treewidth (due to Chatterjee, Meggendorfer, Saona, Svoboda), and the subexponential-time algorithm for ARRIVAL (due to Gärtner, Haslebacher, Hoang). An interesting question is whether this common framework can be further exploited to give better algorithms for either problem.

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