论文信息 - A short proof of correctness of the quasi-polynomial time algorithm for parity games

A short proof of correctness of the quasi-polynomial time algorithm for parity games

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.

Hugo Gimbert | Rasmus Ibsen-Jensen

[1] Wieslaw Zielonka,et al. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[2] Cristian S. Calude,et al. Deciding parity games in quasipolynomial time , 2017, STOC.