THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME

DOI10.1142/S0129054110007246zbMath1188.91044OpenAlexW2147642428MaRDI QIDQ3569271

Oliver Friedmann

Publication date: 18 June 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007246

zbMATH Keywords

lower boundexponential boundparity game\(\mu\)-calculus model checkingStevens-Stirling algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• PGSolver

This page was built for publication: THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME