{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:44Z","timestamp":1750219784716,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3590685","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"591-594","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards a General Boolean Function Benchmark Suite"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1449-5131","authenticated-orcid":false,"given":"Roman","family":"Kalkreuth","sequence":"first","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2279-5217","authenticated-orcid":false,"given":"Zden\u011bk","family":"Va\u0161\u00ed\u010dek","sequence":"additional","affiliation":[{"name":"Brno University of Technology, Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0863-9952","authenticated-orcid":false,"given":"Jakub","family":"Husa","sequence":"additional","affiliation":[{"name":"Brno University of Technology, Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3040-7162","authenticated-orcid":false,"given":"Diederick \u00b4.","family":"Vermetten","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8707-4189","authenticated-orcid":false,"given":"Furong","family":"Ye","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6768-1478","authenticated-orcid":false,"given":"Thomas","family":"B\u00e4ck","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77553-1_3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645511.657085"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb005587"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754769"},{"volume-title":"Application of the Genetic Algorithm to Automatic Program Generation. Master's thesis","author":"Hicklin Joseph","key":"e_1_3_2_1_6_1","unstructured":"Joseph Hicklin . 1986. Application of the Genetic Algorithm to Automatic Program Generation. Master's thesis . University of Idaho . Joseph Hicklin. 1986. Application of the Genetic Algorithm to Automatic Program Generation. Master's thesis. University of Idaho."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390188"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-021-09416-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16670-0_15"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings. of the 4th International conference on Applications of Computer Systems (ACS'97)","author":"Kalganova T.","year":"1997","unstructured":"T. Kalganova . 1997 . Evolutionary Approach to Design Multiple-valued Combinational Circuits . In Proceedings. of the 4th International conference on Applications of Computer Systems (ACS'97) . Szczecin, Poland, 333--339. T. Kalganova. 1997. Evolutionary Approach to Design Multiple-valued Combinational Circuits. In Proceedings. of the 4th International conference on Applications of Computer Systems (ACS'97). Szczecin, Poland, 333--339."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5220\/0008070100820092"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5220\/0011551000003332"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1623755.1623877"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029742"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/892491"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-08-050684-5.50014-8"},{"volume-title":"Genetic programming - on the programming of computers by means of natural selection","author":"Koza John R.","key":"e_1_3_2_1_17_1","unstructured":"John R. Koza . 1993. Genetic programming - on the programming of computers by means of natural selection . MIT Press . John R. Koza. 1993. Genetic programming - on the programming of computers by means of natural selection. MIT Press."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3578482.3578483"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330273"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference, Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith (Eds.)","volume":"2","author":"Miller Julian F.","year":"1999","unstructured":"Julian F. Miller . 1999 . An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach . In Proceedings of the Genetic and Evolutionary Computation Conference, Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith (Eds.) , Vol. 2 . Morgan Kaufmann, Orlando, Florida, USA, 1135--1142. http:\/\/citeseer.ist.psu.edu\/153431.html Julian F. Miller. 1999. An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach. In Proceedings of the Genetic and Evolutionary Computation Conference, Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith (Eds.), Vol. 2. Morgan Kaufmann, Orlando, Florida, USA, 1135--1142. http:\/\/citeseer.ist.psu.edu\/153431.html"},{"key":"e_1_3_2_1_22_1","volume-title":"Arithmetic Circuits: A Case Study. In Genetic Algorithms and Evolution Strategies in Engineering and Computer Science","author":"Miller J. F.","year":"1997","unstructured":"J. F. Miller , P. Thomson , and T. Fogarty . 1997 . Designing Electronic Circuits Using Evolutionary Algorithms . Arithmetic Circuits: A Case Study. In Genetic Algorithms and Evolution Strategies in Engineering and Computer Science . Wiley , 105--131. J. F. Miller, P. Thomson, and T. Fogarty. 1997. Designing Electronic Circuits Using Evolutionary Algorithms. Arithmetic Circuits: A Case Study. In Genetic Algorithms and Evolution Strategies in Engineering and Computer Science. Wiley, 105--131."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205539"},{"key":"e_1_3_2_1_24_1","volume-title":"Moore","author":"Orzechowski Patryk","year":"2021","unstructured":"Patryk Orzechowski and Jason H . Moore . 2021 . Generative and reproducible benchmarks for comprehensive evaluation of machine learning classifiers. CoRR abs\/2107.06475 (2021). arXiv:2107.06475 https:\/\/arxiv.org\/abs\/2107.06475 Patryk Orzechowski and Jason H. Moore. 2021. Generative and reproducible benchmarks for comprehensive evaluation of machine learning classifiers. CoRR abs\/2107.06475 (2021). arXiv:2107.06475 https:\/\/arxiv.org\/abs\/2107.06475"},{"key":"e_1_3_2_1_25_1","volume-title":"Evolutionary algorithms for boolean functions in diverse domains of cryptography. Evolutionary computation 24, 4","author":"Picek Stjepan","year":"2016","unstructured":"Stjepan Picek , Claude Carlet , Sylvain Guilley , Julian F Miller , and Domagoj Jakobovic . 2016. Evolutionary algorithms for boolean functions in diverse domains of cryptography. Evolutionary computation 24, 4 ( 2016 ), 667--694. Stjepan Picek, Claude Carlet, Sylvain Guilley, Julian F Miller, and Domagoj Jakobovic. 2016. Evolutionary algorithms for boolean functions in diverse domains of cryptography. Evolutionary computation 24, 4 (2016), 667--694."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.10.066"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 7th International Conference on Genetic Algorithms","author":"Poli Riccardo","year":"1997","unstructured":"Riccardo Poli . 1997. Evolution of Graph-Like Programs with Parallel Distributed Genetic Programming . In Proceedings of the 7th International Conference on Genetic Algorithms , East Lansing, MI, USA , July 19--23, 1997 , Thomas B\u00e4ck (Ed.). Morgan Kaufmann , 346--353. Riccardo Poli. 1997. Evolution of Graph-Like Programs with Parallel Distributed Genetic Programming. In Proceedings of the 7th International Conference on Genetic Algorithms, East Lansing, MI, USA, July 19--23, 1997, Thomas B\u00e4ck (Ed.). Morgan Kaufmann, 346--353."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92910-9_50"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-021-09413-9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICES.2014.7008732"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-009-9093-2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-012-9177-2"},{"volume-title":"Finding Needles in Haystacks Is Not Hard with Neutrality","author":"Yu Tina","key":"e_1_3_2_1_33_1","unstructured":"Tina Yu and Julian Miller . 2002. Finding Needles in Haystacks Is Not Hard with Neutrality . In Genetic Programming, James A. Foster, Evelyne Lutton, Julian Miller, Conor Ryan, and Andrea Tettamanzi (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 13--25. Tina Yu and Julian Miller. 2002. Finding Needles in Haystacks Is Not Hard with Neutrality. In Genetic Programming, James A. Foster, Evelyne Lutton, Julian Miller, Conor Ryan, and Andrea Tettamanzi (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 13--25."}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23 Companion"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590685","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3590685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:49Z","timestamp":1750178269000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":32,"alternative-id":["10.1145\/3583133.3590685","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3590685","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}