{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:26Z","timestamp":1759638626632,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,17]],"date-time":"2015-01-17T00:00:00Z","timestamp":1421452800000},"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":[[2015,1,17]]},"DOI":"10.1145\/2725494.2725507","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"16-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["On the Black-Box Complexity of Example Functions"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Jansen","sequence":"first","affiliation":[{"name":"Aberystwyth University, Aberystwyth, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598341"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.07.009"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.004"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9684-9"},{"key":"e_1_3_2_1_5_1","first-page":"253","volume-title":"K. A. De Jong","author":"Droste S.","year":"2003","unstructured":"S. Droste , T. Jansen , K. Tinnefeld , and I. Wegener . A new framework for the valuation of algorithms for black-box optimization . In K. A. De Jong , R. Poli, and J. E. Rowe, editors, Foundations of Genetic Algorithms 7 (FOGA), pages 253 -- 270 . Morgan Kaufmann , 2003 . S. Droste, T. Jansen, K. Tinnefeld, and I. Wegener. A new framework for the valuation of algorithms for black-box optimization. In K. A. De Jong, R. Poli, and J. E. Rowe, editors, Foundations of Genetic Algorithms 7 (FOGA), pages 253--270. Morgan Kaufmann, 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1177-z"},{"key":"e_1_3_2_1_9_1","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability. A Guide to the Theory of NP-Completeness . Freeman , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, 1979."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2430679"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2010.18.1.18101"},{"key":"e_1_3_2_1_12_1","first-page":"184","volume-title":"Proceedings of the European Symposium on Algorithms (ESA '99)","author":"Jansen T.","year":"1999","unstructured":"T. Jansen and I. Wegener . The analysis of evolutionary algorithms--A proof that crossover really can help. In J. Nesetril, editor , Proceedings of the European Symposium on Algorithms (ESA '99) , pages 184 -- 193 . Springer , 1999 . T. Jansen and I. Wegener. The analysis of evolutionary algorithms--A proof that crossover really can help. In J. Nesetril, editor, Proceedings of the European Symposium on Algorithms (ESA '99), pages 184--193. Springer, 1999."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830747"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"}],"event":{"name":"FOGA '15: Foundations of Genetic Algorithms XIII","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Aberystwyth United Kingdom","acronym":"FOGA '15"},"container-title":["Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2725494.2725507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2725494.2725507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:32Z","timestamp":1750227392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2725494.2725507"}},"subtitle":["The Real Jump Function"],"short-title":[],"issued":{"date-parts":[[2015,1,17]]},"references-count":16,"alternative-id":["10.1145\/2725494.2725507","10.1145\/2725494"],"URL":"https:\/\/doi.org\/10.1145\/2725494.2725507","relation":{},"subject":[],"published":{"date-parts":[[2015,1,17]]},"assertion":[{"value":"2015-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}