A Discrete Subexponential Algorithm for Parity Games
- 17 February 2003
- book chapter
- Published by Springer Nature
- p. 663-674
- https://doi.org/10.1007/3-540-36494-3_58
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Tree automata, mu-calculus and determinacyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms, games, and the internetPublished by Association for Computing Machinery (ACM) ,2001
- Small Progress Measures for Solving Parity GamesPublished by Springer Nature ,2000
- A Discrete Strategy Improvement Algorithm for Solving Parity GamesPublished by Springer Nature ,2000
- Mean Cost Cyclical GamesMathematics of Operations Research, 1999
- Model checking and the mu-calculusPublished by American Mathematical Society (AMS) ,1997
- A survey of linear programming in randomized subexponential timeACM SIGACT News, 1995
- A SUBEXPONENTIAL RANDOMIZED ALGORITHM FOR THE SIMPLE STOCHASTIC GAME PROBLEMInformation and Computation, 1995
- On model-checking for fragments of μ-calculusPublished by Springer Nature ,1993
- Cyclic games and an algorithm to find minimax cycle means in directed graphsUSSR Computational Mathematics and Mathematical Physics, 1988