Skip to main content
Log in

What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming

  • Published:
Genetic Programming and Evolvable Machines Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

W. B. Langdon

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daida, J.M., Bertram, R.R., Stanhope, S.A. et al. What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. Genetic Programming and Evolvable Machines 2, 165–191 (2001). https://doi.org/10.1023/A:1011504414730

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011504414730

Navigation