scientific article; zbMATH DE number 7533361
From MaRDI portal
Publication:5079761
DOI10.4230/LIPICS.CSL.2018.36MaRDI QIDQ5079761
Sven Schewe, Martín G. Zimmermann, Alexander Weinert
Publication date: 28 May 2022
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 (4)
The Theory of Universal Graphs for Infinite Duration Games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantitative reductions and vertex-ranked infinite games
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
- 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*†
- Finitary winning in ω-regular games
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Symmetric Strategy Improvement
- 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
- Formal Methods for Components and Objects
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication:
