What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
- 148 Downloads
This paper addresses the issue of what makes a problem genetic programming (GP)-hard by considering the binomial-3 problem. In the process, we discuss the efficacy of the metaphor of an adaptive fitness landscape to explain what is GP-hard. We indicate that, at least for this problem, the metaphor is misleading.
Unable to display preview. Download preview PDF.