21. Jan 2020
Parity Games — the quasi-polynomial era
Datum: 21. January 2020 |
09:00 –
10:00
Sprecher:
Karoliina Lehtinen, University of Liverpool
Veranstaltungsort: Mondi Seminar Room 2, Central Building
In 2017 a major breakthrough occurred: parity games are solvable in quasi-polynomial time. Since then, several seemingly very distinct quasi-polynomial algorithms have been published, both by myself and others, and some of the novel ideas behind them have been applied to address other problems in automata theory.
In this talk, I will give an overview of these developments, including my own contribution to them, and the state-of-the art, with a slight automata-theoretic bias.