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

From MaRDI portal
Revision as of 02:32, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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