What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes

  title={What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes},
  author={Jason M. Daida and Hsiaolei Li and Ricky Tang and Adam M. Hilss},
This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test problem anticipated by this hypothesis. The problem is tunably difficult, but has this property because tuning is accomplished through changes in structure. Content is not involved in tuning. The results support a prediction of the hypothesis – that GP search space is significantly constrained as an outcome of structural… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 82 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-10 of 44 extracted citations

Representation and structural difficulty in genetic programming

IEEE Transactions on Evolutionary Computation • 2006
View 10 Excerpts
Highly Influenced

Representation and structural biases in CGP

2009 IEEE Congress on Evolutionary Computation • 2009
View 4 Excerpts
Highly Influenced

83 Citations

Citations per Year
Semantic Scholar estimates that this publication has 83 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 20 references

Similar Papers

Loading similar papers…