Priority Promotion with Parysian flair

We develop an algorithm that combines the advantages of Priority Promotion, that is one of the leading approaches to solving large parity games in practice, with the quasi-polynomial time guarantees offered by Parys' algorithm. Hybridising these algorithms sounds both natural and difficult, as...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 147; s. 103580
Hlavní autori:	Benerecetti, Massimo, Dell'Erba, Daniele, Mogavero, Fabio, Schewe, Sven, Wojtczak, Dominik
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.02.2025
Predmet:	Parity games Quasi dominion Quasi polynomial algorithms Parity games Quasi dominion Quasi polynomial algorithms
ISSN:	0022-0000
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!