Smaller progress measures and separating automata for parity games

Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to several approaches with quasi-polynomial complexity. Jurdzinski and Lazic have further improved the precise complexity of parity games, especially when the number of prioriti...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Frontiers in computer science (Lausanne) Jg. 4
Hauptverfasser:	Dell'Erba, Daniele, Schewe, Sven
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Frontiers Media S.A 20.09.2022
Schlagworte:	parity games progress measures quasi-polynomial algorithms separating automata value iteration
ISSN:	2624-9898, 2624-9898
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!