Computational Complexity Results for Genetic Programming and the Sorting Problem

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Misc{journals/corr/abs-1103-5797,

• title = "Computational Complexity Results for Genetic Programming and the Sorting Problem",
• author = "Markus Wagner and Frank Neumann",
• journal = "CoRR",
• year = "2011",
• volume = "abs/1103.5797",
• note = "informal publication",
• bibdate = "2011-04-01",
• bibsource = "DBLP, http://dblp.uni-trier.de/db/journals/corr/corr1103.html#abs-1103-5797",
• URL = "http://arxiv.org/abs/1103.5797",
• keywords = "genetic algorithms, genetic programming",
• abstract = "Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems with isolated program semantics. With this paper, we push forward the computational complexity analysis of GP on a problem with dependent program semantics. We study the well-known sorting problem in this context and analyse rigorously how GP can deal with different measures of sortedness.",

}

Genetic Programming entries for Markus Wagner Frank Neumann

Citations