Emergent Mind
Improving the complexity of Parys' recursive algorithm
(1904.11810)
Published Apr 26, 2019
in
cs.GT
and
cs.DS
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 $2{O((\log n)(\log c))}$, while providing polynomial bounds when the number of colours is logarithmic.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.