%0 Journal Article
%1 journals/gpem/DaidaBSKCCP01
%A Daida, Jason M.
%A Bertram, Robert R.
%A Stanhope, Stephen A.
%A Khoo, Jonathan C.
%A Chaudhary, Shahbaz A.
%A Chaudhri, Omer A.
%A Polito, John
%D 2001
%J Genetic Programming and Evolvable Machines
%K dblp
%N 2
%P 165-191
%T What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming.
%U http://dblp.uni-trier.de/db/journals/gpem/gpem2.html#DaidaBSKCCP01
%V 2
@article{journals/gpem/DaidaBSKCCP01,
added-at = {2011-05-25T00:00:00.000+0200},
author = {Daida, Jason M. and Bertram, Robert R. and Stanhope, Stephen A. and Khoo, Jonathan C. and Chaudhary, Shahbaz A. and Chaudhri, Omer A. and Polito, John},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2541588a3b5cd417d7b17e343beb66bfd/dblp},
ee = {http://dx.doi.org/10.1023/A:1011504414730},
interhash = {a6d7a21dde145e1059cab74fe395d8c0},
intrahash = {541588a3b5cd417d7b17e343beb66bfd},
journal = {Genetic Programming and Evolvable Machines},
keywords = {dblp},
number = 2,
pages = {165-191},
timestamp = {2016-02-02T02:11:36.000+0100},
title = {What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming.},
url = {http://dblp.uni-trier.de/db/journals/gpem/gpem2.html#DaidaBSKCCP01},
volume = 2,
year = 2001
}
