Algorithms for solving parity games
From MaRDI portal
Publication:3172529
Recommendations
Cited in
(33)- Computing Game Values for Crash Games
- Mathematical Foundations of Computer Science 2005
- Parameterized Algorithms for Parity Games
- Parity game reductions
- Games through Nested Fixpoints
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Solving parity games by a reduction to SAT
- Efficient algorithms for games played on trees with back-edges
- Solving parity games in practice
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Solving counter parity games
- Algorithms for Parity Games
- Recursive algorithm for parity games requires exponential time
- Linear complementarity algorithms for infinite games
- Games for verification: Algorithmic issues
- scientific article; zbMATH DE number 7455738 (Why is no real title available?)
- Parity games on undirected graphs
- scientific article; zbMATH DE number 1962853 (Why is no real title available?)
- A Multi-Core Solver for Parity Games
- Solving Parity Games on the GPU
- scientific article; zbMATH DE number 1773090 (Why is no real title available?)
- Solving parity games using an automata-based algorithm
- Solving Parity Games in Big Steps
- scientific article; zbMATH DE number 1670778 (Why is no real title available?)
- Graph operations on parity games and polynomial-time algorithms
- Exponential examples of solving parity games
- Alternating traps in Muller and parity games
- Attracting tangles to solve parity games
- Solving parity games in big steps
- Effectively solvable classes of cyclical games
- A CSP-Based Approach for Solving Parity Game
- A brief excursion to parity games
- Justifications and a reconstruction of parity game solving algorithms
This page was built for publication: Algorithms for solving parity games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172529)
