Universal trees grow inside separating automata:Quasi-polynomial lower bounds for parity games

Tools

Czerwinski, Wojciech, Daviaud, Laure, Fijalkow, Nathanaël, Jurdzinski, Marcin, Lazić, Ranko and Parys, Pawel (2019) Universal trees grow inside separating automata:Quasi-polynomial lower bounds for parity games. In: Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics (SIAM), USA, pp. 2333-2349.

Full text not available from this repository.

Abstract

Several distinct techniques have been proposed to design quasi-polynomial algorithms for solving parity games since the breakthrough result of Calude, Jain, Khoussainov, Li, and Stephan (2017): play summaries, progress measures and register games. We argue that all those techniques can be viewed as instances of the separation approach to solving parity games, a key technical component of which is constructing (explicitly or implicitly) an automaton that separates languages of words encoding plays that are (decisively) won by either of the two players. Our main technical result is a quasi-polynomial lower bound on the size of such separating automata that nearly matches the current best upper bounds. This forms a barrier that all existing approaches must overcome in the ongoing quest for a polynomial-time algorithm for solving parity games. The key and fundamental concept that we introduce and study is a universal ordered tree. The technical highlights are a quasi-polynomial lower bound on the size of universal ordered trees and a proof that every separating safety automaton has a universal tree hidden in its state space.

Item Type:	Book Section
Additional Information:	Publisher Copyright: Copyright © 2019 by SIAM.
Uncontrolled Keywords:	software,mathematics(all) ,/dk/atira/pure/subjectarea/asjc/1700/1712
Related URLs:	http://www.scopus.com/inward/record.url?...
Depositing User:	LivePure Connector
Date Deposited:	08 Jun 2023 14:30
Last Modified:	08 Jun 2023 14:30
URI:	https://ueaeprints.uea.ac.uk/id/eprint/92348
DOI:	10.1137/1.9781611975482.142

Actions (login required)

View Item