Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions
This paper provides the first runtime analysis of Cartesian Genetic Programming (CGP) in evolving Boolean functions, establishing bounds of O(nD^5) for conjunctions and exponential time for XOR, highlighting the impact of selection strategies.
Duc-Cuong Dang, Roman Kalkreuth, Andre Opris