1. M. Collins, “Counting solutions in reduced boolean parity,” in GECCO 2004 Workshop Proceedings, R. Poli et al. (eds.), Seattle, Washington, 26--30 June 2004.
2. M. Collins, “Monte carlo sampling and counting solutions in reduced boolean parity,” Technical Report, November 2004. EDI-INF-RR-0240.
3. W.B. Langdon and R. Poli, “Boolean functions fitness spaces,” in Late Breaking Papers at the Genetic Programming 1998 Conference, J. R. Kozai, (ed.), University of Wisconsin, Madison, Wisconsin, USA, 22–25 July 1998. Stanford University Bookstore.
4. J.F. Miller, “An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach,” in Proceedings of the Genetic and Evolutionary Computation Conference, Wolf- gang Banzhaf et al. (eds.), Morgan Kaufmann, 1999, vol. 2, pp. 1135--1142.
5. J.F. Miller and P. Thomson, “Cartesian genetic programming,” in Genetic Programming, Proceedings of EuroGP'2000, vol. 1802 of LNCS, Riccardo Poli et al. (ed.), Springer-Verlag, Edinburgh: 15--16 April 2000, pp. 121–132.