@inproceedings{63b81b856808445aaafe109cdb45dca7,
title = "The max problem revisited: The importance of mutation in genetic programming",
abstract = "This paper contributes to the rigorous understanding of genetic programming algorithms by providing runtime complexity analyses of the well-studied Max problem. Several experimental studies have indicated that it is hard to solve the Max problem with crossover-based algorithms. Our analyses show that different variants of the Max problem can provably be solved using simple mutation-based genetic programming algorithms. Our results advance the body of computational complexity analyses of genetic programming, indicate the importance of mutation in genetic programming, and reveal new insights into the behavior of mutation-based genetic programming algorithms.",
keywords = "genetic programming, mutation, runtime analysis, theory",
author = "Timo K{\"o}tzing and Sutton, {Andrew M.} and Frank Neumann and O'Reilly, {Una May}",
year = "2012",
doi = "10.1145/2330163.2330348",
language = "English (US)",
isbn = "9781450311779",
series = "GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation",
pages = "1333--1340",
booktitle = "GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation",
note = "14th International Conference on Genetic and Evolutionary Computation, GECCO'12 ; Conference date: 07-07-2012 Through 11-07-2012",
}