Paper Info
Title
A short proof of correctness of the quasi-polynomial time algorithm for parity games.
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.
Year
Venue
Field
2017
arXiv: Formal Languages and Automata Theory
Discrete mathematics,Correctness,Quasi-polynomial,Algorithm,Parity (mathematics),Mathematics
DocType
Volume
Citations 
Journal
abs/1702.01953
2
PageRank 
References 
Authors
0.42
2
2
Name
Order
Citations
PageRank
Gimbert, H.153.21
Rasmus Ibsen-Jensen26912.65