"What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in ..."

Jason M. Daida et al. (2001)

> Home

Details and statistics

DOI: 10.1023/A:1011504414730

access: closed

type: Journal Article

metadata version: 2020-09-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gpem/DaidaBSKCCP01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gpem/DaidaBSKCCP01
Jason M. Daida, Robert R. Bertram, Stephen A. Stanhope, Jonathan C. Khoo, Shahbaz A. Chaudhary, Omer A. Chaudhri, John Polito:
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. Genet. Program. Evolvable Mach. 2(2): 165-191 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.