M. Antony and P. Bartlett, Neural network learning : Theoretical foundations, 1999.
DOI : 10.1017/CBO9780511624216

W. Banzhaf and W. B. Langdon, Some considerations on the reason for bloat, Genetic Programming and Evolvable Machines, vol.3, issue.1, pp.81-91, 2002.
DOI : 10.1023/A:1014548204452

T. Blickle and L. Thiele, Genetic programming and redundancy, Genetic Algorithms Workshop at KI-94, pp.33-38, 1994.

J. M. Daida, What makes a problem gp-hard? analysis of a tunably difficult problem in genetic programming, Genetic Programming and Evolvable Machines, pp.165-191, 2001.

L. Devroye, L. Györfi, and G. Lugosi, A probabilistic theory of pattern recognition, springer, 1997.

S. Gustafson, A. Ekart, E. Burke, and G. Kendall, Problem Difficulty and Code Growth in Genetic Programming, Genetic Programming and Evolvable Machines, vol.5, issue.3, pp.271-290, 2004.
DOI : 10.1023/B:GENP.0000030194.98244.e3

J. R. Koza, Genetic programming as a means for programming computers by natural selection, Statistics and Computing, vol.4, issue.2, 1992.
DOI : 10.1007/BF00175355

W. B. Langdon, The evolution of size in variable length representations, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360), pp.633-638, 1998.
DOI : 10.1109/ICEC.1998.700102

W. B. Langdon, Size fair and homologous tree genetic programming crossovers, Genetic Programming and Evolvable Machines, vol.1, issue.1/2, pp.95-119, 2000.
DOI : 10.1023/A:1010024515191

W. B. Langdon and R. Poli, Fitness causes bloat: Mutation, Late Breaking Papers at GP'97, pp.132-140, 1997.
DOI : 10.1007/BFb0055926

W. B. Langdon, T. Soule, R. Poli, and J. A. Foster, The evolution of size and shape, Advances in Genetic Programming III, pp.163-190, 1999.

S. Luke and L. Panait, Lexicographic parsimony pressure, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pp.829-836, 2002.

N. F. Mcphee and J. D. Miller, Accurate replication in genetic programming, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pp.303-309, 1995.

P. Nordin and W. Banzhaf, Complexity compression and evolution, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pp.310-317, 1995.

A. Ratle and M. Sebag, Avoiding the bloat with probabilistic grammar-guided genetic programming, Artificial Evolution VI, 2001.

S. Silva and J. Almeida, Dynamic Maximum Tree Depth, Genetic and Evolutionary Computation ? GECCO-2003, pp.1776-1787, 2003.
DOI : 10.1007/3-540-45110-2_69

T. Soule, Exons and Code Growth in Genetic Programming, LNCS, vol.2278, pp.142-151, 2002.
DOI : 10.1007/3-540-45984-7_14

T. Soule and J. A. Foster, Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming, Evolutionary Computation, vol.6, issue.4, pp.293-309, 1998.
DOI : 10.1162/evco.1995.3.1.17

V. Vapnik, The nature of statistical learning theory, 1995.

B. Zhang and H. Mulenbein, Balancing Accuracy and Parsimony in Genetic Programming, Evolutionary Computation, vol.7, issue.3, 1995.
DOI : 10.1214/aos/1176350051

B. Zhang, P. Ohm, and H. Muhlenbein, Evolutionary Induction of Sparse Neural Trees, Evolutionary Computation, vol.1, issue.4, pp.213-236, 1997.
DOI : 10.1214/aos/1176350051