Calude, Cristian S.; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank Deciding parity games in quasipolynomial time. (English) Zbl 1369.68234 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 252-263 (2017). Cited in 7 ReviewsCited in 66 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 91A43 Games involving graphs Keywords:Muller games; parity games; quasipolynomial-time algorithm PDFBibTeX XMLCite \textit{C. S. Calude} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 252--263 (2017; Zbl 1369.68234) Full Text: DOI