scientific article; zbMATH DE number 7104928
From MaRDI portal
Publication:5232902
Sven Schewe, Alexander Weinert, Martín G. Zimmermann
Publication date: 13 September 2019
Full work available at URL: https://arxiv.org/abs/1804.06168
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Games involving topology, set theory, or logic (91A44) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Solving parity games in big steps
- Results on the propositional \(\mu\)-calculus
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- Borel determinacy
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- The complexity of mean payoff games on graphs
- An improved algorithm for the evaluation of fixpoint expressions
- Energy parity games
- McNaughton games and extracting strategies for concurrent programs
- On Promptness in Parity Games*†
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Symmetric Strategy Improvement
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- Deciding parity games in quasipolynomial time
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- A modal μ perspective on solving parity games in quasi-polynomial time
- Parity and Streett Games with Costs
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication:
