scientific article; zbMATH DE number 7439727

zbMath1478.68139arXiv1609.04085MaRDI QIDQ5015265

Michael Huth, Patrick Ah-Fat

Publication date: 7 December 2021

Full work available at URL: https://arxiv.org/abs/1609.04085

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• PGSolver

Cites Work

• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• The Rabin index of parity games: its complexity and approximation
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Entanglement and the complexity of directed graphs
• Static Analysis of Parity Games: Alternating Reachability Under Parity
• Recursive algorithm for parity games requires exponential time
• An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
• A deterministic subexponential algorithm for solving parity games
• Solving Parity Games in Practice
• Fatal Attractors in Parity Games
• Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
• DAG-Width and Parity Games

This page was built for publication: