On Fixed-Parameter Complexity of Infinite Games
作者： Sven Sandberg , Sergei Vorobyov , Henrik Björklund
DOI:
关键词:
摘要:
参考文章(11)
Henrik Björklund, Sven Sandberg, Sergei Vorobyov, A Discrete Subexponential Algorithm for Parity Games symposium on theoretical aspects of computer science. pp. 663- 674 ,(2003) , 10.1007/3-540-36494-3_58
Michael R. Fellows, New Directions and New Challenges in Algorithm Design and Complexity, Parameterized workshop on algorithms and data structures. pp. 505- 519 ,(2003) , 10.1007/978-3-540-45078-8_44
Wolfgang Thomas, Languages, automata, and logic Handbook of formal languages, vol. 3. pp. 389- 455 ,(1997) , 10.1007/978-3-642-59126-6_7
Anne Condon, The complexity of stochastic games Information & Computation. ,vol. 96, pp. 203- 224 ,(1992) , 10.1016/0890-5401(92)90048-K
Yuri Gurevich, Leo Harrington, Trees, automata, and games Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. pp. 60- 65 ,(1982) , 10.1145/800070.802177
V.A. Gurvich, A.V. Karzanov, L.G. Khachivan, Cyclic games and an algorithm to find minimax cycle means in directed graphs Ussr Computational Mathematics and Mathematical Physics. ,vol. 28, pp. 85- 91 ,(1990) , 10.1016/0041-5553(88)90012-2
Viktor Petersson, Sergei Vorobyov, A randomized subexponential algorithm for parity games Nordic Journal of Computing. ,vol. 8, pp. 324- 345 ,(2001)
N. N. Pisaruk, Mean Cost Cyclical Games Mathematics of Operations Research. ,vol. 24, pp. 817- 828 ,(1999) , 10.1287/MOOR.24.4.817
R. Downey, Parameterized complexity for the skeptic conference on computational complexity. pp. 147- 168 ,(2003) , 10.1109/CCC.2003.1214417
A. J. Hoffman, R. M. Karp, On Nonterminating Stochastic Games Management Science. ,vol. 12, pp. 359- 370 ,(1966) , 10.1287/MNSC.12.5.359