On the time and space complexity of genetic programming for evolving Boolean conjunctions

Lissovoi, A. and Oliveto, P.S. (2019) On the time and space complexity of genetic programming for evolving Boolean conjunctions. Journal of Artificial Intelligence Research, 66. pp. 655-689. ISSN 1076-9757

Abstract

Metadata

Authors/Creators:
  • Lissovoi, A.
  • Oliveto, P.S.
Copyright, Publisher and Additional Information: © 2019 AI Access Foundation. Reproduced in accordance with the publisher's self-archiving policy.
Dates:
  • Published (online): 12 November 2019
  • Published: 12 November 2019
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Funding Information:
FunderGrant number
ENGINEERING AND PHYSICAL SCIENCE RESEARCH COUNCIL (EPSRC)EP/M004252/1
Depositing User: Symplectic Sheffield
Date Deposited: 04 Dec 2019 10:19
Last Modified: 04 Dec 2019 10:19
Status: Published
Publisher: AI Access Foundation
Refereed: Yes
Identification Number: https://doi.org/10.1613/jair.1.11821

Export

Statistics