Author:
Dohrau Jérôme,Gärtner Bernd,Kohler Manuel,Matoušek Jiří,Welzl Emo
Publisher
Springer International Publishing
Reference6 articles.
1. A. Condon, The complexity of stochastic games. Inf. Comput. 96(2), 203–224 (1992)
2. N. Halman, Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems. Algorithmica 49(1), 37–50 (2007)
3. M. Jurdziński, Deciding the winner in parity games is in UP ∩ co-UP. Inf. Process. Lett. 68(3), 119–124 (1998)
4. C.S. Karthik, Did the train reach its destination: the complexity of finding a witness (2016). https//arxiv.org/abs/1609.03840
5. B. Katz, I. Rutter, G. Woeginger, An algorithmic study of switch graphs. Acta Inf. 49(5), 295–312 (2012)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献