1. Altenberg, L.: The evolution of evolvability in genetic programming. In: Kinnear, K. (ed.) Advances in Genetic Programming, pp. 47–74. MIT Press, Cambridge (1994)
2. Clergue, M., Collard, P., Tomassini, M., Vanneschi, L.: Fitness distance correlation and problem difficulty for genetic programming. In: Langdon, W.B., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2002, New York City, USA, pp. 724–732. Morgan Kaufmann, San Francisco (2002), (Best Conference Paper Award Nomination)
3. Daida, J.M., Bertram, R., Stanhope, S., Khoo, J., Chaudhary, S., Chaudhary, O.: What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. Genetic Programming and Evolvable Machines 2, 165–191 (2001)
4. Lecture Notes in Computer Science;A. Ekárt,2002
5. Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque (1995)