暂无分享,去创建一个
[1] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[2] Henrik Björklund,et al. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discret. Appl. Math..
[3] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[4] Uri Zwick,et al. A deterministic subexponential algorithm for solving parity games , 2006, SODA '06.
[5] R. Karp,et al. On Nonterminating Stochastic Games , 1966 .
[6] Henrik Björklund,et al. A Discrete Subexponential Algorithm for Parity Games , 2003, STACS.
[7] A. Puri. Theory of hybrid systems and discrete event systems , 1996 .
[8] Henrik Björklund,et al. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discrete Applied Mathematics.
[9] M. Paterson,et al. A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.
[10] Helmut Seidl,et al. Precise Relational Invariants Through Strategy Iteration , 2007, CSL.
[11] Marcin Jurdziński,et al. Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..
[12] Yishay Mansour,et al. On the Complexity of Policy Iteration , 1999, UAI.
[13] Henrik Björklund,et al. Optimization on Completely Unimodal Hypercubes , 2002 .
[14] E. Emerson,et al. Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.
[15] Marcin Jurdzinski,et al. A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.