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

Full description

Bibliographic Details

Published in:	Frontiers in computer science (Lausanne) Vol. 4
Main Authors:	Dell'Erba, Daniele, Schewe, Sven
Format:	Journal Article
Language:	English
Published:	Frontiers Media S.A 20.09.2022
Subjects:	parity games progress measures quasi-polynomial algorithms separating automata value iteration
ISSN:	2624-9898, 2624-9898
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!