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: Friday, November 14, 2014, 12:15 pm

Duration: 30 minutes

Location: CAB G11

Speaker: Matthias Mnich (Universität Bonn)

A faster algorithm for parity games

Solving parity games is an important algorithmic task to problems in automated verification and controller synthesis. The model-checking problem for the modal $\mu$-calculus is known to be equivalent to parity game solving, and problems like validity or satisfiability for modal logics can be reduced to parity game solving. It is a major open problem whether a polynomial-time algorithm for solving parity games exists. To date, the fastest known algorithm runs in time $(n+m)^{O(\sqrt{n + m})}$, where $n$ denotes the number of nodes in the parity game controlled by the even player and $m$ denotes the number of nodes controlled by the odd player. This algorithm is due to Jurdziński, Paterson and Zwick (SODA 2006, SICOMP 2008). We give a faster algorithm for solving parity games, in time $(n+m)^{O(\sqrt{\min(m,n)})}$.

Joint work with H. Röglin and C. Rösner.

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