Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
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

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Article Open access 22 November 2023

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

  1. Artificial Intelligence Laboratory and Space Physics Research Laboratory, The University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI, 48109-2143, USA

    Jason M. Daida, Robert R. Bertram, Stephen A. Stanhope, Jonathan C. Khoo, Shahbaz A. Chaudhary & Omer A. Chaudhri

  2. Consilient, Inc., 1815 4th Street, Suite B, Berkeley, CA, 94710, USA

    John A. II Polito

Authors
  1. Jason M. Daida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert R. Bertram
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stephen A. Stanhope
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jonathan C. Khoo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shahbaz A. Chaudhary
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Omer A. Chaudhri
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. John A. II Polito
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Search

Navigation