A Recursive Approach to Solving Parity Games in Quasipolynomial Time

04/20/2021

∙

by   Karoliina Lehtinen, et al.

∙

0

∙

share

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 Zielonka's classic algorithm that brings its complexity down to n^𝒪(log(1+d/log n)), for parity games of size n with d priorities, in line with previous quasipolynomial-time solutions.