H. Everett, 2. RECURSIVE GAMES, Contributions to the Theory of Games, pp.67-78, 1957.
DOI : 10.1515/9781400882151-004
URL : https://hal.archives-ouvertes.fr/inria-00103926

R. L. Graham and N. J. Sloane, Anti-Hadamard matrices, Linear Algebra and its Applications, vol.62, pp.113-137, 1984.
DOI : 10.1016/0024-3795(84)90090-9
URL : http://doi.org/10.1016/0024-3795(84)90090-9

N. Alon and V. H. V?uv?u, Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs, Journal of Combinatorial Theory, Series A, vol.79, issue.1, pp.79-133, 1997.
DOI : 10.1006/jcta.1997.2780
URL : http://doi.org/10.1006/jcta.1997.2780

K. A. Hansen, M. Kouck´ykouck´y, and P. B. Miltersen, Winning Concurrent Reachability Games Requires Doubly-Exponential Patience, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.332-341
DOI : 10.1109/LICS.2009.44
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.996

K. A. Hansen, R. Ibsen-jensen, and P. B. Miltersen, The complexity of solving reachability games using value and strategy iteration, p.6

K. A. Hansen, M. Kouck´ykouck´y, N. Lauritzen, P. B. Miltersen, and E. P. Tsigaridas, Exact algorithms for solving stochastic games, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.205-214, 2011.
DOI : 10.1145/1993636.1993665

R. J. Lipton and N. E. Young, Simple strategies for large zero-sum games with applications to complexity theory, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, pp.734-740, 1994.
DOI : 10.1145/195058.195447

L. S. Shapley and R. N. Snow, 3. BASIC SOLUTIONS OF DISCRETE GAMES, Contributions to the Theory of Games, number 24 in Annals of Mathematics Studies, pp.27-35, 1950.
DOI : 10.1515/9781400881727-004

J. Neumann, Zur Theorie der Gesellschaftsspiele, Mathematische Annalen, vol.100, issue.1, pp.295-320, 1928.
DOI : 10.1007/BF01448847

J. Håstad, On the Size of Weights for Threshold Gates, SIAM Journal on Discrete Mathematics, vol.7, issue.3, pp.484-492, 1994.
DOI : 10.1137/S0895480192235878

V. V. Podolskii, Perceptrons of large weight, Problems of Information Transmission, vol.45, issue.1, pp.46-53, 2009.
DOI : 10.1134/S0032946009010062

L. Babai, K. A. Hansen, V. V. Podolskii, and X. Sun, Weights of Exact Threshold Functions, Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, pp.66-77, 2010.
DOI : 10.1007/978-3-642-15155-2_8

N. J. Sloane, Unsolved problems related to the covering radius of codes Open problems in communication and computation, pp.51-56, 1987.

R. M. Roth and K. Viswanathan, On the Hardness of Decoding the Gale-Berlekamp Code, 2007 IEEE International Symposium on Information Theory, pp.1050-1060, 2008.
DOI : 10.1109/ISIT.2007.4557411

D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, How easy is local search?, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.79-100, 1988.
DOI : 10.1109/SFCS.1985.31

A. A. Schäffer and M. Yannakakis, Simple Local Search Problems that are Hard to Solve, SIAM Journal on Computing, vol.20, issue.1, pp.56-87, 1991.
DOI : 10.1137/0220004

S. T. Mccormick, M. Rao, and G. Rinaldi, Easy and difficult objective functions for max cut, Mathematical Programming, vol.94, issue.2-3, pp.459-466, 2003.
DOI : 10.1007/s10107-002-0328-8

L. Ching, The maximum determinant of an n ?? n lower Hessenberg (0, 1) matrix, Linear Algebra and its Applications, vol.183, pp.147-153, 1993.
DOI : 10.1016/0024-3795(93)90429-R

R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Computers in Physics, vol.3, issue.5, 1994.
DOI : 10.1063/1.4822863