A short proof of correctness of the quasi-polynomial time algorithm for parity games
published by Hugo Gimbert
in 2017
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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.