Computational complexity, genetic programming, and implications

DOI10.1007/3-540-45355-5_28MaRDI QIDQ2768651zbMATH OpenFDO

Authors James A. Foster

Publication date 3 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2038/20380348

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Slightly Beyond Turing’s Computability for Studying Genetic Programming
• Single- and multi-objective genetic programming
• Foundations of genetic programming
• Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions

Cited in

(8)

• An evolutionary approach for the target search problem in uncertain environment
• scientific article; zbMATH DE number 5299689 (Why is no real title available?)
• Slightly Beyond Turing’s Computability for Studying Genetic Programming
• More on computational effort statistics for genetic programming
• An analysis of Koza's computational effort statistic for genetic programming
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
• The time complexity analysis of a class of gene expression programming
• Soft computing analysis for estimation of the combustion characteristics of a biogas-fuelled spark ignition engine

This page was built for publication: Computational complexity, genetic programming, and implications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768651)