{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:30Z","timestamp":1750306950777,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,6]],"date-time":"2013-07-06T00:00:00Z","timestamp":1373068800000},"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":[[2013,7,6]]},"DOI":"10.1145\/2464576.2482680","type":"proceedings-article","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T13:26:51Z","timestamp":1374672411000},"page":"617-640","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Black-box complexity"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Max Planck Institute f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Max Planck Institute f\u00fcr Informatik, Saarbr\u00fccken, Germany & Universit\u00e8 Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Kurt Mehlhorn, and Carola Winzen. The query complexity of finding a hidden permutation. Electronic Colloquium on Computational Complexity (ECCC): Report Series, 87 (Revision 1):1--36","author":"Afshani Peyman","year":"2012","unstructured":"Peyman Afshani , Manindra Agrawal , Benjamin Doerr , Kasper Green Larsen , Kurt Mehlhorn, and Carola Winzen. The query complexity of finding a hidden permutation. Electronic Colloquium on Computational Complexity (ECCC): Report Series, 87 (Revision 1):1--36 , 2012 . Available online at http:\/\/eccc.hpi-web.de\/report\/2012\/087\/#revision1. Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Kasper Green Larsen, Kurt Mehlhorn, and Carola Winzen. The query complexity of finding a hidden permutation. Electronic Colloquium on Computational Complexity (ECCC): Report Series, 87 (Revision 1):1--36, 2012. Available online at http:\/\/eccc.hpi-web.de\/report\/2012\/087\/#revision1."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527135"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-007-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463480"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830618"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967669"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001710"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001851"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627867"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35533-2_18"},{"key":"e_1_3_2_1_13_1","first-page":"441","volume-title":"Proc. of Symposion on Theoretical Aspects of Computer Science (STACS'12)","author":"Doerr Benjamin","year":"2012","unstructured":"Benjamin Doerr and Carola Winzen . Playing Mastermind with constant-size memory . In Proc. of Symposion on Theoretical Aspects of Computer Science (STACS'12) , pages 441 -- 452 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 2012 . Benjamin Doerr and Carola Winzen. Playing Mastermind with constant-size memory. In Proc. of Symposion on Theoretical Aspects of Computer Science (STACS'12), pages 441--452. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330345"},{"key":"e_1_3_2_1_15_1","first-page":"1","volume-title":"Algorithmica","author":"Doerr Benjamin","year":"2013","unstructured":"Benjamin Doerr and Carola Winzen . Ranking-based black-box complexity . Algorithmica , pages 1 -- 39 , 2013 . To appear. Available online at: http:\/\/www.springerlink.com\/content\/fp8861331l0252r0\/. Extended abstract in the Proc. of Computer Science Symposium in Russia (CSR'11). Benjamin Doerr and Carola Winzen. Ranking-based black-box complexity. Algorithmica, pages 1--39, 2013. To appear. Available online at: http:\/\/www.springerlink.com\/content\/fp8861331l0252r0\/. Extended abstract in the Proc. of Computer Science Symposium in Russia (CSR'11)."},{"key":"e_1_3_2_1_16_1","first-page":"229","article-title":"On two problems of information theory","volume":"8","author":"Erd\u0151s Paul","year":"1963","unstructured":"Paul Erd\u0151s and Alfr\u00e9ed R\u00e9enyi . On two problems of information theory . Magyar Tudom\u00e1nyos Akad\u00e9emia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei , 8 : 229 -- 243 , 1963 . Paul Erd\u0151s and Alfr\u00e9ed R\u00e9enyi. On two problems of information theory. Magyar Tudom\u00e1nyos Akad\u00e9emia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei, 8:229--243, 1963.","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9emia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei"},{"key":"e_1_3_2_1_17_1","first-page":"195","article-title":"On a combinatory detection problem I","volume":"9","author":"Lindstr\u00f6m Bernt","year":"1964","unstructured":"Bernt Lindstr\u00f6m . On a combinatory detection problem I . Publications of the Mathematical Institute of the Hungarian Academy of Science , 9 : 195 -- 207 , 1964 . Bernt Lindstr\u00f6m. On a combinatory detection problem I. Publications of the Mathematical Institute of the Hungarian Academy of Science, 9:195--207, 1964.","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Science"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1965-034-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_20_1","first-page":"15","volume-title":"Proc. of Parallel Problem Solving From Nature (PPSN'92)","author":"M\u00fchlenbein Heinz","year":"1992","unstructured":"Heinz M\u00fchlenbein . How genetic algorithms really work. Mutation and hillclimbing . In Proc. of Parallel Problem Solving From Nature (PPSN'92) , pages 15 -- 25 . North-Holland , 1992 . Heinz M\u00fchlenbein. How genetic algorithms really work. Mutation and hillclimbing. In Proc. of Parallel Problem Solving From Nature (PPSN'92), pages 15--25. North-Holland, 1992."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277149"},{"key":"e_1_3_2_1_23_1","volume-title":"Kovac","author":"Rudolph G\u00fcnter","year":"1997","unstructured":"G\u00fcnter Rudolph . Convergence Properties of Evolutionary Algorithms . Kovac , 1997 . G\u00fcnter Rudolph. Convergence Properties of Evolutionary Algorithms. Kovac, 1997."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001850"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006650"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"}],"event":{"name":"GECCO '13: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Amsterdam The Netherlands","acronym":"GECCO '13"},"container-title":["Proceedings of the 15th annual conference companion on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464576.2482680","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2464576.2482680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:38:59Z","timestamp":1750235939000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464576.2482680"}},"subtitle":["from complexity theory to playing mastermind"],"short-title":[],"issued":{"date-parts":[[2013,7,6]]},"references-count":27,"alternative-id":["10.1145\/2464576.2482680","10.1145\/2464576"],"URL":"https:\/\/doi.org\/10.1145\/2464576.2482680","relation":{},"subject":[],"published":{"date-parts":[[2013,7,6]]},"assertion":[{"value":"2013-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}