A short proof of correctness of the quasi-polynomial time algorithm for parity games
arXiv:1702.01953
Abstract
Recently Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank Stephan proposed a quasi-polynomial time algorithm for parity games. This paper proposes a short proof of correctness of their algorithm.