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

Jason M. Daida, John Polito, Steven A. Stanhope, Robert R. Bertram, Jonathan C. Khoo, Shahbaz A. Chaudhary

Browse the full GECCO paper archive.