. Anonymous-github, Code for demonstrating correctness of Longest Descent, 2019.

U. Bertelé and F. Brioschi, Nonserial Dynamic Programming, 1972.

J. Horn, D. E. Goldberg, and K. Deb, Long path problems, International Conference on Parallel Problem Solving from Nature, pp.149-158, 1994.

A. Kaznatcheev, Computational complexity as an ultimate constraint on evolution, Genetics, vol.212, issue.1, pp.245-265, 2019.

A. Kaznatcheev, D. A. Cohen, and P. G. Jeavons, Representing fitness landscapes by valued constraints to understand the complexity of local search, International Conference on Principles and Practice of Constraint Programming, pp.300-316, 2019.

D. A. , Adaptation on rugged landscapes, Manage. Sci, vol.43, issue.7, pp.934-950, 1997.

P. Meseguer and F. Rossi, Handbook of Constraint Programming, pp.281-328, 2006.

J. W. Rivkin and N. Siggelkow, Patterned interactions in complex systems: Implications for exploration, Manage. Sci, vol.53, issue.7, pp.1068-1085, 2007.

T. Roughgarden, Computing equilibria: A computational complexity perspective, Econom. Theory, vol.42, pp.193-236, 2010.

D. Simoncini, S. Barbe, and T. Schiex, Sébastien Verel, Fitness landscape analysis around the optimum in computational protein design, Proceedings of the Genetic and Evolutionary Computation Conference, pp.355-362, 2018.

T. Taylor, M. Bedau, A. Channon, D. Ackley, W. Banzhaf et al., Open-ended evolution: Perspectives from the OEE workshop in York, Artif. Life, vol.22, issue.3, pp.408-423, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01371116

S. Wright, The roles of mutation, inbreeding, crossbreeding, and selection in evolution, Proceedings of the Sixth International Congress on Genetics, pp.355-366, 1932.