An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have recently shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal on software tools for technology transfer 2019-06, Vol.21 (3), p.325-349
Hauptverfasser:	Fearnley, John, Jain, Sanjay, de Keijzer, Bart, Schewe, Sven, Stephan, Frank, Wojtczak, Dominik
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Color matching Complexity Computer Science Data structures Games Lower bounds Parity Polynomials Production scheduling Software Engineering Software Engineering/Programming and Operating Systems Spin 2017 Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!