Improvement in small progress measures
From MaRDI portal
Publication:5013885
Recommendations
Cites work
- A deterministic subexponential algorithm for solving parity games
- Algorithms for Parity Games
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- Automata, logics, and infinite games. A guide to current research
- Faster algorithms for mean-payoff games
- Games for synthesis of controllers with partial observation.
- scientific article; zbMATH DE number 1670778 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Non-oblivious strategy improvement
- Recursive algorithm for parity games requires exponential time
- Solving Parity Games in Big Steps
- Solving parity games in practice
- Symmetric strategy improvement
- Zielonka's recursive algorithm: dull, weak and solitaire games and tighter bounds
Cited in
(2)
This page was built for publication: Improvement in small progress measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013885)