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...

Celý popis

Podrobná bibliografia

Vydané v:	Frontiers in computer science (Lausanne) Ročník 4
Hlavní autori:	Dell'Erba, Daniele, Schewe, Sven
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Frontiers Media S.A 20.09.2022
Predmet:	parity games progress measures quasi-polynomial algorithms separating automata value iteration
ISSN:	2624-9898, 2624-9898
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!