Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
Attributed to:
The Alan Turing Institute
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611975482.142
Publication URI: http://dx.doi.org/10.1137/1.9781611975482.142
Type: Book Chapter
Book Title: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (2019)
Page Reference: 2333-2349