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

Wojciech Czerwinski, Laure Daviaud, Nathanal Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys

Browse the full SODA paper archive.