Created by W.Langdon from gp-bibliography.bib Revision:1.7970
The former approach has the advantage of being able to produce a large number of functions in a relatively short time, but it directly depends on the size of the search space. In this paper, we present a method to evolve algebraic constructions for generation of bent Boolean functions. To strengthen our approach, we define three types of constructions and give experimental results for them. Our results show that this approach is able to produce a large number of constructions, which could in turn enable the construction of many more Boolean functions with a larger number of variables.",
KU Leuven Belgium, Faculty of Electrical Engineering and Computing Croatia
GECCO-2016 A Recombination of the 25th International Conference on Genetic Algorithms (ICGA-2016) and the 21st Annual Genetic Programming Conference (GP-2016)",
Genetic Programming entries for Stjepan Picek Domagoj Jakobovic