Created by W.Langdon from gp-bibliography.bib Revision:1.8051
XOR parity growing solutions
Recursive functions. Cites Hastad,1989 saying prove that minimal solution to n-parity is exponential in n. Then uses _exhaustive search_ to solve n=2.",
Genetic Programming entries for Mariusz Nowostawski