{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:11:41Z","timestamp":1777360301205,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,30]]},"DOI":"10.1145\/3594805.3607131","type":"proceedings-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T11:03:28Z","timestamp":1690801408000},"page":"84-95","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["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":"Computer Lab of Paris 6, Sorbonne, University, Paris, France"}],"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","family":"Vermetten","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden University, 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 University, 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 University, Leiden, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,30]]},"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_2_1","volume-title":"Benchmarking in Optimization: Best Practice and Open Issues. CoRR abs\/2007.03488","author":"Bartz-Beielstein Thomas","year":"2020","unstructured":"Thomas Bartz-Beielstein, Carola Doerr, Jakob Bossek, Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, Pascal Kerschke, Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Katherine M. Malan, Jason H. Moore, Boris Naujoks, Patryk Orzechowski, Vanessa Volz, Markus Wagner, and Thomas Weise. 2020. Benchmarking in Optimization: Best Practice and Open Issues. CoRR abs\/2007.03488 (2020). arXiv:2007.03488 https:\/\/arxiv.org\/abs\/2007.03488"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90050-7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851743"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511780448.011"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785775"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645511.657085"},{"key":"e_1_3_2_1_9_1","volume-title":"IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics. CoRR abs\/2111.04077","author":"de Nobel Jacob","year":"2021","unstructured":"Jacob de Nobel, Furong Ye, Diederick Vermetten, Hao Wang, Carola Doerr, and Thomas B\u00e4ck. 2021. IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics. CoRR abs\/2111.04077 (2021). arXiv:2111.04077 https:\/\/arxiv.org\/abs\/2111.04077"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106246"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb005587"},{"key":"e_1_3_2_1_12_1","volume-title":"Hachtel and Fabio Somenzi","author":"Gary","year":"1996","unstructured":"Gary D. Hachtel and Fabio Somenzi. 1996. Logic synthesis and verification algorithms. Kluwer."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1808977"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2009.4982960"},{"key":"e_1_3_2_1_15_1","volume-title":"Logic synthesis and verification","author":"Hassoun Soha","unstructured":"Soha Hassoun and Tsutomu Sasao. 2001. Logic synthesis and verification. Vol. 654. Springer Science & Business Media."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459285"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754769"},{"key":"e_1_3_2_1_18_1","volume-title":"Application of the Genetic Algorithm to Automatic Program Generation. Master's thesis","author":"Hicklin Joseph","unstructured":"Joseph Hicklin. 1986. Application of the Genetic Algorithm to Automatic Program Generation. Master's thesis. University of Idaho."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390188"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-021-09416-6"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 2nd International Conference on Genetic Algorithms","author":"Holland John H.","year":"1987","unstructured":"John H. Holland. 1987. Genetic Algorithms and Classifier Systems: Foundations and Future Directions. In Proceedings of the 2nd International Conference on Genetic Algorithms, Cambridge, MA, USA, July 1987, John J. Grefenstette (Ed.). Lawrence Erlbaum Associates, 82--89."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1045343.1045373"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598343"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16670-0_15"},{"key":"e_1_3_2_1_25_1","volume-title":"Evolving Cryptographic Boolean Functions with Minimal Multiplicative Complexity. In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1--8.","author":"Husa Jakub","year":"2020","unstructured":"Jakub Husa and Lukas Sekanina. 2020. Evolving Cryptographic Boolean Functions with Minimal Multiplicative Complexity. In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1--8."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107327"},{"key":"e_1_3_2_1_27_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."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5220\/0008070100820092"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5220\/0011551000003332"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67190-1_26"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1623755.1623877"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029742"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/892491"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-08-050684-5.50014-8"},{"key":"e_1_3_2_1_35_1","volume-title":"Genetic programming - on the programming of computers by means of natural selection","author":"Koza John R.","unstructured":"John R. Koza. 1993. Genetic programming - on the programming of computers by means of natural selection. MIT Press."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3578482.3578483"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330273"},{"key":"e_1_3_2_1_40_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"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17310-3_2"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-46239-2_9"},{"key":"e_1_3_2_1_43_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."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3533624"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205539"},{"key":"e_1_3_2_1_46_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"},{"key":"e_1_3_2_1_47_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."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.10.066"},{"key":"e_1_3_2_1_49_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."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92910-9_50"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-021-09413-9"},{"key":"e_1_3_2_1_52_1","first-page":"443","article-title":"Balanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity","volume":"2010","author":"Tang Xiaohu","year":"2010","unstructured":"Xiaohu Tang, Deng Tang, Xiangyong Zeng, and Lei Hu. 2010. Balanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity. IACR Cryptology ePrint Archive 2010 (2010), 443.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_53_1","volume-title":"On the number of bent functions from iterative constructions: lower bounds and hypotheses. Cryptology ePrint Archive","author":"Tokareva Natalia","year":"2011","unstructured":"Natalia Tokareva. 2011. On the number of bent functions from iterative constructions: lower bounds and hypotheses. Cryptology ePrint Archive (2011)."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106737"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67997-6_2"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICES.2014.7008732"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29139-5_23"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-009-9093-2"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510426"},{"key":"e_1_3_2_1_60_1","volume-title":"The Complexity of Boolean Functions","author":"Wegener Ingo","year":"1991","unstructured":"Ingo Wegener. 1991. The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science). (1991)."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-012-9177-2"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058679"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58115-2_49"},{"key":"e_1_3_2_1_65_1","volume-title":"Finding Needles in Haystacks Is Not Hard with Neutrality","author":"Yu Tina","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."}],"event":{"name":"FOGA '23: Foundations of Genetic Algorithms XVII","location":"Potsdam Germany","acronym":"FOGA '23","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 17th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3594805.3607131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3594805.3607131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:01Z","timestamp":1750182541000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3594805.3607131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":63,"alternative-id":["10.1145\/3594805.3607131","10.1145\/3594805"],"URL":"https:\/\/doi.org\/10.1145\/3594805.3607131","relation":{},"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"2023-08-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}