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

Genetic Programming and Evolvable Machines 2 (2001)
  Copy   BIBTEX

Abstract

This paper addresses the issue of what makes a problem genetic programming -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.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 101,810

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2021-08-05

Downloads
12 (#1,388,535)

6 months
6 (#891,050)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references