{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:55:54Z","timestamp":1776887754914,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M004252\/1"],"award-info":[{"award-number":["EP\/M004252\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321851","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"1003-1011","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Evolving boolean functions with conjunctions and disjunctions via genetic programming"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Lissovoi","sequence":"additional","affiliation":[{"name":"The University of Sheffield, Sheffield, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pietro S.","family":"Oliveto","sequence":"additional","affiliation":[{"name":"The University of Sheffield, Sheffield, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Andrea De Lorenzo, and Eric Medvet","author":"Bartoli Alberto","year":"2014","unstructured":"Alberto Bartoli , Simone Cumar , Andrea De Lorenzo, and Eric Medvet . 2014 . Compressing Regular Expression Sets for Deep Packet Inspection. In Proceedings of Parallel Problem Solving from Nature - PPSN XIII. Springer , 394--403. Alberto Bartoli, Simone Cumar, Andrea De Lorenzo, and Eric Medvet. 2014. Compressing Regular Expression Sets for Deep Packet Inspection. In Proceedings of Parallel Problem Solving from Nature - PPSN XIII. Springer, 394--403."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr. 2011. Analyzing Randomized Search Heuristics: Tools from Probability Theory. In Theory of Randomized Search Heuristics Anne Auger and Benjamin Doerr (Eds.). World Scientific 1--20.  Benjamin Doerr. 2011. Analyzing Randomized Search Heuristics: Tools from Probability Theory. In Theory of Randomized Search Heuristics Anne Auger and Benjamin Doerr (Eds.). World Scientific 1--20.","DOI":"10.1142\/9789814282673_0001"},{"key":"e_1_3_2_1_3_1","volume-title":"Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. CoRR abs\/1801.06733","author":"Doerr Benjamin","year":"2018","unstructured":"Benjamin Doerr . 2018. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. CoRR abs\/1801.06733 ( 2018 ). arXiv:1801.06733 Benjamin Doerr. 2018. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. CoRR abs\/1801.06733 (2018). arXiv:1801.06733"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9585-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071271"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967661"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645822.670510"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.014"},{"key":"e_1_3_2_1_11_1","volume-title":"Genetic programming - on the programming of computers by means of natural selection","author":"Koza John R.","unstructured":"John R. Koza . 1992. Genetic programming - on the programming of computers by means of natural selection . MIT Press . John R. Koza. 1992. Genetic programming - on the programming of computers by means of natural selection. MIT Press."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-010-9112-3"},{"key":"e_1_3_2_1_13_1","volume-title":"Oliveto","author":"Lehre Per Kristian","year":"2018","unstructured":"Per Kristian Lehre and Pietro S . Oliveto . 2018 . Theoretical Analysis of Stochastic Search Algorithms. In Handbook of Heuristics, Rafael Mart\u00ed, Panos M. Pardalos, and Mauricio G. C. Resende (Eds.). Springer , 849--884. Per Kristian Lehre and Pietro S. Oliveto. 2018. Theoretical Analysis of Stochastic Search Algorithms. In Handbook of Heuristics, Rafael Mart\u00ed, Panos M. Pardalos, and Mauricio G. C. Resende (Eds.). Springer, 849--884."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"A. Lissovoi and P.S. Oliveto. 2019. Computational Complexity Analysis of Genetic Programming. In Theory of Randomized Search Heuristics in Discrete Search Spaces (to appear) Benjamin Doerr and Frank Neumann (Eds.). Springer. arXiv:1811.04465.  A. Lissovoi and P.S. Oliveto. 2019. Computational Complexity Analysis of Genetic Programming. In Theory of Randomized Search Heuristics in Discrete Search Spaces (to appear) Benjamin Doerr and Frank Neumann (Eds.). Springer. arXiv:1811.04465.","DOI":"10.1007\/978-3-030-29414-4_11"},{"key":"e_1_3_2_1_15_1","volume-title":"Oliveto","author":"Lissovoi Andrei","year":"2018","unstructured":"Andrei Lissovoi and Pietro S . Oliveto . 2018 . On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence. AAAI Press , 1363--1370. Andrei Lissovoi and Pietro S. Oliveto. 2018. On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence. AAAI Press, 1363--1370."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI","author":"Liu Li","year":"2013","unstructured":"Li Liu and Ling Shao . 2013 . Learning Discriminative Representations from RGB-D Video Data . In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). IJCAI\/AAAI, 1493--1500. Li Liu and Ling Shao. 2013. Learning Discriminative Representations from RGB-D Video Data. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). IJCAI\/AAAI, 1493--1500."},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO","author":"Luke Sean","year":"2002","unstructured":"Sean Luke and Liviu Panait . 2002 . Lexicographic Parsimony Pressure . In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002). Morgan Kaufmann, 829--836. Sean Luke and Liviu Panait. 2002. Lexicographic Parsimony Pressure. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002). Morgan Kaufmann, 829--836."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30668-1_7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1108\/17563780910959893"},{"key":"e_1_3_2_1_20_1","volume-title":"Oliveto and Xin Yao","author":"Pietro","year":"2011","unstructured":"Pietro S. Oliveto and Xin Yao . 2011 . Runtime analysis of evolutionary algorithms for discrete optimization. In Theory of Randomized Search Heuristics: Foundations and Recent Developments, Anne Auger and Benjamin Doerr (Eds.). World Scientific , Chapter 2, 21--52. Pietro S. Oliveto and Xin Yao. 2011. Runtime analysis of evolutionary algorithms for discrete optimization. In Theory of Randomized Search Heuristics: Foundations and Recent Developments, Anne Auger and Benjamin Doerr (Eds.). World Scientific, Chapter 2, 21--52."},{"key":"e_1_3_2_1_21_1","volume-title":"Advances in Genetic Programming 2","author":"O'Reilly Una May","unstructured":"Una May O'Reilly and Franz Oppacher . 1996. A comparative analysis of GP . In Advances in Genetic Programming 2 . MIT Press , 23--44. Una May O'Reilly and Franz Oppacher. 1996. A comparative analysis of GP. In Advances in Genetic Programming 2. MIT Press, 23--44."},{"key":"e_1_3_2_1_22_1","unstructured":"Riccardo Poli William B. Langdon and Nicholas Freitag McPhee. 2008. A Field Guide to Genetic Programming. http:\/\/lulu.com.   Riccardo Poli William B. Langdon and Nicholas Freitag McPhee. 2008. A Field Guide to Genetic Programming. http:\/\/lulu.com."}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321851","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:29Z","timestamp":1750206329000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":21,"alternative-id":["10.1145\/3321707.3321851","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321851","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}