1. Altenberg, L.: Fitness distance correlation analysis: An instructive counterexample. In: Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 57–64. Morgan Kaufmann Publishers Inc., San Francisco (1997)
2. Lecture Notes in Computer Science;W. Banzhaf,1994
3. Barnett, L.: Ruggedness and neutrality: The nkp family of fitness landscapes. In: Aami, R., et al. (eds.) Artificial Live VI: Proceedings of the Sixth International Conference on Artificial Life, pp. 18–27. MIT Press, Cambridge (1998)
4. Clergue, M., Collard, P., Tomassini, M., Vanneschi, L.: Fitness distance correlation and problem difficulty for genetic programming. In: Langdon, W.B., et al. (eds.) GECCO 2002. Proceedings of the Genetic and Evolutionary Computation Conference, July 9-13, 2002, pp. 724–732. Morgan Kaufmann Publishers, New York (2002)
5. Collins, M.: Finding needles in haystacks is harder with neutrality. In: Beyer, H.-G., et al. (eds.) GECCO 2005. Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington, June 25-29, 2005, vol. 2, pp. 1613–1618. ACM Press, New York (2005)