Improving the complexity of Parys' recursive algorithm

04/26/2019

∙

by   Karoliina Lehtinen, et al.

∙

0

∙

share

Parys has recently proposed a quasi-polynomial version of Zielonka's recursive algorithm for solving parity games. In this brief note we suggest a variation of his algorithm that improves the complexity to meet the state-of-the-art complexity of broadly 2^O(( n)( c)), while providing polynomial bounds when the number of colours is logarithmic.