Emergent Mind
A short proof of correctness of the quasi-polynomial time algorithm for parity games
(1702.01953)
Published Feb 7, 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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.