Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games (Q5236329)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games |
scientific article; zbMATH DE number 7117491
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games |
scientific article; zbMATH DE number 7117491 |
Statements
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games (English)
0 references
15 October 2019
0 references
