A Recursive Approach to Solving Parity Games in Quasipolynomial Time

Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity is exponential, while currently the state-of-the-art algorithms have quasipolynomial complexity. Here, we present a modification of Zie...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Logical methods in computer science Jg. 18, Issue 1; H. 1; S. 8:1 - 8:18
Hauptverfasser:	Lehtinen, Karoliina, Parys, Paweł, Schewe, Sven, Wojtczak, Dominik
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science Association 01.01.2022 Logical Methods in Computer Science e.V
Schlagworte:	Computer Science computer science - computer science and game theory computer science - formal languages and automata theory
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!