Deciding the winner in parity games is in UP ∩ co-UP
- 1 November 1998
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 68 (3) , 119-124
- https://doi.org/10.1016/s0020-0190(98)00150-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The complexity of mean payoff games on graphsTheoretical Computer Science, 1996
- The complexity of stochastic gamesInformation and Computation, 1992
- Cyclic games and an algorithm to find minimax cycle means in directed graphsUSSR Computational Mathematics and Mathematical Physics, 1988
- Positional strategies for mean payoff gamesInternational Journal of Game Theory, 1979