The following publications are possibly variants of this publication:
- Characterizing a Tunably Difficult Problem in Genetic ProgrammingOmer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo, Wendell S. Richardsons, Rachel Harrison, William J. Sloat. gecco 2000: 395-402
- What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic ProgrammingJason M. Daida, Robert R. Bertram, Stephen A. Stanhope, Jonathan C. Khoo, Shahbaz A. Chaudhary, Omer A. Chaudhri, John Polito. gpem, 2(2):165-191, 2001.
- What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic ProgrammingJason M. Daida, John Polito, Steven A. Stanhope, Robert R. Bertram, Jonathan C. Khoo, Shahbaz A. Chaudhary. gecco 1999: 982-989
- Probing for limits to building block mixing with a tunably-difficult problem for genetic programmingJason M. Daida, Michael E. Samples, Matthew J. Byom. gecco 2005: 1713-1720 [doi]