Recursive algorithm for parity games requires exponential time (Q3117548)

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