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

First Author: Czerwinski W
Attributed to:  The Alan Turing Institute funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1807.10546

Publication URI: https://arxiv.org/abs/1807.10546

Type: Other