Algorithms for Parity Games
From MaRDI portal
Publication:4412830
DOI10.1007/3-540-36387-4_7zbMath1021.91500OpenAlexW2176543585MaRDI QIDQ4412830
Publication date: 16 July 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36387-4_7
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) 2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Unnamed Item ⋮ A Multi-Core Solver for Parity Games ⋮ Polynomial-Time Under-Approximation of Winning Regions in Parity Games ⋮ Complexity of tropical and MIN-plus linear prevarieties
This page was built for publication: Algorithms for Parity Games
