2000 character limit reached
A short proof of correctness of the quasi-polynomial time algorithm for parity games (1702.01953v4)
Published 7 Feb 2017 in cs.FL and cs.GT
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.