2 results
Karoliina Lehtinen ; Udi Boker.
The complexity of parity games is a long standing open problem that saw a major breakthrough in 2017 when two quasi-polynomial algorithms were published. This article presents a third, independent approach to solving parity games in quasi-polynomial time, based on the notion of register game, a […]
Published on May 19, 2020
Karoliina Lehtinen ; Paweł Parys ; Sven Schewe ; Dominik Wojtczak.
Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity is exponential, while currently the state-of-the-art algorithms have quasipolynomial complexity. Here, we present a modification of […]
Published on January 12, 2022