On the Time Complexity of Simple Cartesian Genetic Programming

Roman Kalkreuth, Andre Droschinsky

2019

Abstract

Since its introduction, Cartesian Genetic Programming has been mostly analyzed on an experimental level with boolean function problems. Consequently, there is still little theoretical understanding of Cartesian Genetic Programming. In this paper, we present a first time complexity analysis of Cartesian Genetic Programming. We introduce and analyze a simple mathematical problem and a simple logical boolean problem called SUM and AND. The results of our analysis show that simple CGP is able to solve SUM efficiently in time Θ(nlogn). However, our analysis of the AND problem shows that simple CGP is not able to solve AND efficiently.

Paper Citation

in Harvard Style

Kalkreuth R. and Droschinsky A. (2019). On the Time Complexity of Simple Cartesian Genetic Programming. In Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - Volume 1: ECTA; ISBN 978-989-758-384-1, SciTePress, pages 172-179. DOI: 10.5220/0008070201720179

in Bibtex Style

@conference{ecta19,
author={Roman Kalkreuth and Andre Droschinsky},
title={On the Time Complexity of Simple Cartesian Genetic Programming},
booktitle={Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - Volume 1: ECTA},
year={2019},
pages={172-179},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008070201720179},
isbn={978-989-758-384-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - Volume 1: ECTA
TI - On the Time Complexity of Simple Cartesian Genetic Programming
SN - 978-989-758-384-1
AU - Kalkreuth R.
AU - Droschinsky A.
PY - 2019
SP - 172
EP - 179
DO - 10.5220/0008070201720179
PB - SciTePress