Improving the complexity of Parys' recursive algorithm
Computer Science and Game Theory
2019-06-06 v4 Data Structures and Algorithms
Abstract
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 , while providing polynomial bounds when the number of colours is logarithmic.
Keywords
Cite
@article{arxiv.1904.11810,
title = {Improving the complexity of Parys' recursive algorithm},
author = {Karoliina Lehtinen and Sven Schewe and Dominik Wojtczak},
journal= {arXiv preprint arXiv:1904.11810},
year = {2019}
}