Algorithms for solving parity games
From MaRDI portal
Publication:3172529
zbMATH Open1229.91083MaRDI QIDQ3172529FDOQ3172529
Publication date: 5 October 2011
Recommendations
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43)
Cited In (22)
- Algorithms for Parity Games
- Games for verification: Algorithmic issues
- Title not available (Why is that?)
- Solving Parity Games on the GPU
- Title not available (Why is that?)
- Effectively solvable classes of cyclical games
- Linear complementarity algorithms for infinite games
- Computing Game Values for Crash Games
- Solving parity games by a reduction to SAT
- Title not available (Why is that?)
- A Multi-Core Solver for Parity Games
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Attracting tangles to solve parity games
- Parity game reductions
- Mathematical Foundations of Computer Science 2005
- Games through Nested Fixpoints
- Title not available (Why is that?)
- Solving Parity Games in Big Steps
- Parameterized Algorithms for Parity Games
- A CSP-Based Approach for Solving Parity Game
- Solving parity games in practice
- Recursive algorithm for parity games requires exponential time
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)
