On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions

DOI10.1613/JAIR.1.11821zbMath1494.68253OpenAlexW2983227719MaRDI QIDQ4972727

Pietro S. Oliveto, Andrei Lissovoi

Publication date: 26 November 2019

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11821

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error ⋮ Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming ⋮ The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time

This page was built for publication: On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions