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

From MaRDI portal
Revision as of 15:32, 18 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references

    Identifiers