BibTeX record journals/gpem/DaidaBSKCCP01

• > Home > journals/gpem/DaidaBSKCCP01

@article{DBLP:journals/gpem/DaidaBSKCCP01,
  author       = {Jason M. Daida and
                  Robert R. Bertram and
                  Stephen A. Stanhope and
                  Jonathan C. Khoo and
                  Shahbaz A. Chaudhary and
                  Omer A. Chaudhri and
                  John Polito},
  title        = {What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem
                  in Genetic Programming},
  journal      = {Genet. Program. Evolvable Mach.},
  volume       = {2},
  number       = {2},
  pages        = {165--191},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1011504414730},
  doi          = {10.1023/A:1011504414730},
  timestamp    = {Tue, 01 Sep 2020 13:12:59 +0200},
  biburl       = {https://dblp.org/rec/journals/gpem/DaidaBSKCCP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}