Parameterized Algorithms for Parity Games (Q2946404): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The dag-width of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entanglement and the complexity of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memoryless determinacy of parity and mean payoff games: a simple proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition theorems and model-checking for the modal <i>μ</i> -calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the evaluation of fixpoint expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of stochastic \(\omega \)-regular games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph operations on parity games and polynomial-time algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Tree Automata and Logics of Programs / 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: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph measures: Kelly decompositions, games, and orderings / 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: Memoryless Determinacy of Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games played on finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width and 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: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 19:23, 10 July 2024

scientific article
Language Label Description Also known as
English
Parameterized Algorithms for Parity Games
scientific article

    Statements

    Parameterized Algorithms for Parity Games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references