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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099407508 / rank
 
Normal rank

Revision as of 03:32, 20 March 2024

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