Recursive algorithm for parity games requires exponential time (Q3117548)

From MaRDI portal
Revision as of 21:27, 30 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Recursive algorithm for parity games requires exponential time
scientific article

    Statements

    Recursive algorithm for parity games requires exponential time (English)
    0 references
    0 references
    28 February 2012
    0 references
    parity games
    0 references
    recursive algorithm
    0 references
    lower bound
    0 references
    \(\mu\)-calculus
    0 references
    model checking
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references