scientific article; zbMATH DE number 7471697
From MaRDI portal
Sven Schewe, Karoliina Lehtinen, Dominik Wojtczak, Paweł Parys
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2104.09717
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Reachability games and parity games, Universal algorithms for parity games and nested fixpoints, Improved complexity analysis of quasi-polynomial algorithms solving parity games
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Borel determinacy
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Robust worst cases for parity games algorithms
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games
- Recursive algorithm for parity games requires exponential time
- Exponential Lower Bounds for Policy Iteration
- A modal μ perspective on solving parity games in quasi-polynomial time
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- On model checking for the \(\mu\)-calculus and its fragments
