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



Gimbert, Hugo and Ibsen-Jensen, Rasmus
(2017) A short proof of correctness of the quasi-polynomial time algorithm for parity games. CoRR, abs/17.

Access the full-text of this item by clicking on the Open Access link.
Item Type: Article
Depositing User: Symplectic Admin
Date Deposited: 06 Dec 2018 09:20
Last Modified: 09 Jan 2021 04:32
Open Access URL: https://arxiv.org/pdf/1702.01953.pdf
URI: https://livrepository.liverpool.ac.uk/id/eprint/3029566