Patience of matrix games
暂无分享,去创建一个
Kristoffer Arnsfelt Hansen | Vladimir V. Podolskii | Elias P. Tsigaridas | Rasmus Ibsen-Jensen | Rasmus Ibsen-Jensen | V. Podolskii
[1] Kristoffer Arnsfelt Hansen,et al. Weights of exact threshold functions , 2010, MFCS.
[2] J. Spencer. Ten lectures on the probabilistic method , 1987 .
[3] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[4] Richard J. Lipton,et al. Simple strategies for large zero-sum games with applications to complexity theory , 1994, STOC '94.
[5] Johan Håstad,et al. On the Size of Weights for Threshold Gates , 1994, SIAM J. Discret. Math..
[6] Mark W. Krentel. Structure in Locally Optimal Solutions (Extended Abstract) , 1989, FOCS 1989.
[7] Giovanni Rinaldi,et al. Easy and difficult objective functions for max cut , 2003, Math. Program..
[8] Vladimir V. Podolskii,et al. Perceptrons of large weight , 2007, Probl. Inf. Transm..
[9] Li Ching. The maximum determinant of an n×n lower Hessenberg (0, 1) matrix , 1993 .
[10] N. J. A. Sloane. Unsolved Problems Related to the Covering Radius of Codes , 1987 .
[11] M. Dufwenberg. Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.
[12] Ronald L. Graham,et al. Anti-Hadamard matrices , 1984 .
[13] Noga Alon,et al. Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs , 1997, J. Comb. Theory, Ser. A.
[14] Ron M. Roth,et al. On the Hardness of Decoding the Gale–Berlekamp Code , 2007, IEEE Transactions on Information Theory.
[15] Kristoffer Arnsfelt Hansen,et al. Exact algorithms for solving stochastic games: extended abstract , 2011, STOC.
[16] J. Neumann. Zur Theorie der Gesellschaftsspiele , 1928 .
[17] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[18] Mihalis Yannakakis,et al. Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..
[19] Mark W. Krentel,et al. Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.
[20] Kristoffer Arnsfelt Hansen,et al. Winning Concurrent Reachability Games Requires Doubly-Exponential Patience , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.
[21] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[22] Kristoffer Arnsfelt Hansen,et al. The Complexity of Solving Reachability Games Using Value and Strategy Iteration , 2013, Theory of Computing Systems.