Recursive algorithm for parity games requires exponential time (Q3117548): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1051/ita/2011124 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On model checking for the \(\mu\)-calculus and its fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic subexponential algorithm for solving parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games in Big Steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/ITA/2011124 / rank
 
Normal rank

Latest revision as of 17:20, 20 December 2024

scientific article
Language Label Description Also known as
English
Recursive algorithm for parity games requires exponential time
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references