On the Time Complexity of Simple Cartesian Genetic Programming

Roman Kalkreuth, Andre Droschinsky. On the Time Complexity of Simple Cartesian Genetic Programming. In Juan Julián Merelo Guervós, Jonathan Garibaldi, Alejandro Linares-Barranco, Kurosh Madani, Kevin Warwick, editors, Proceedings of the 11th International Joint Conference on Computational Intelligence, IJCCI 2019, Vienna, Austria, September 17-19, 2019. pages 172-179, ScitePress, 2019. [doi]

@inproceedings{KalkreuthD19,
  title = {On the Time Complexity of Simple Cartesian Genetic Programming},
  author = {Roman Kalkreuth and Andre Droschinsky},
  year = {2019},
  doi = {10.5220/0008070201720179},
  url = {https://doi.org/10.5220/0008070201720179},
  researchr = {https://researchr.org/publication/KalkreuthD19},
  cites = {0},
  citedby = {0},
  pages = {172-179},
  booktitle = {Proceedings of the 11th International Joint Conference on Computational Intelligence, IJCCI 2019, Vienna, Austria, September 17-19, 2019},
  editor = {Juan Julián Merelo Guervós and Jonathan Garibaldi and Alejandro Linares-Barranco and Kurosh Madani and Kevin Warwick},
  publisher = {ScitePress},
  isbn = {978-989-758-384-1},
}