%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 Genet. Program. Evolvable Mach. %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 = {2020-09-01T00: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://www.bibsonomy.org/bibtex/24cca5782e6e50add327efc2467f0777f/dblp}, ee = {https://doi.org/10.1023/A:1011504414730}, interhash = {a6d7a21dde145e1059cab74fe395d8c0}, intrahash = {4cca5782e6e50add327efc2467f0777f}, journal = {Genet. Program. Evolvable Mach.}, keywords = {dblp}, number = 2, pages = {165-191}, timestamp = {2020-09-09T12:54:51.000+0200}, 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 }