{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:25Z","timestamp":1750220545611,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"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":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459325","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:51:58Z","timestamp":1624297918000},"page":"644-651","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Quadratization of gray coded representations, long path problems and needle functions"],"prefix":"10.1145","author":[{"given":"Darrell","family":"Whitley","sequence":"first","affiliation":[{"name":"Colorado State University"}]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[{"name":"University of M\u00e1laga, M\u00e1laga, Spain"}]},{"given":"Hernan","family":"Aguirre","sequence":"additional","affiliation":[{"name":"Shinshu University, Nagano, Japan"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"e_1_3_2_1_2_1","volume-title":"On Quadratization of Pseudo-Boolean Functions. Symposium on AI and Mathematics","author":"Boros E.","year":"2012","unstructured":"E. Boros and A. Gruber . On Quadratization of Pseudo-Boolean Functions. Symposium on AI and Mathematics , 2012 . E. Boros and A. Gruber. On Quadratization of Pseudo-Boolean Functions. Symposium on AI and Mathematics, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3205455.3205482"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/2576768.2598304"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/3071178.3071285"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.5555\/80156"},{"key":"e_1_3_2_1_7_1","first-page":"437","volume-title":"On the Tree Width of NK Landscapes In Genetic and Evolutionary Computation Conference (GECCO), LLCN, Springer-Verlag","author":"Gao Y.","year":"2003","unstructured":"Y. Gao and J. Culberson . On the Tree Width of NK Landscapes In Genetic and Evolutionary Computation Conference (GECCO), LLCN, Springer-Verlag , pages 437 -- 444 , 2003 Y. Gao and J. Culberson. On the Tree Width of NK Landscapes In Genetic and Evolutionary Computation Conference (GECCO), LLCN, Springer-Verlag, pages 437--444, 2003"},{"key":"e_1_3_2_1_8_1","first-page":"89","volume-title":"Foundations of Artificial Intelligence Vol 3","author":"Gomes C.P.","unstructured":"C.P. Gomes , H. Kautz , A. Sabharwal , B. Selman . Satisfiability Solvers . In Foundations of Artificial Intelligence Vol 3 , pages 89 -- 134 . Elsevier . C.P. Gomes, H. Kautz, A. Sabharwal, B. Selman. Satisfiability Solvers. In Foundations of Artificial Intelligence Vol 3, pages 89--134. Elsevier."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/3-540-58484-6_259"},{"key":"e_1_3_2_1_10_1","volume-title":"Efficient linkage discovery by limited probing. Evolutionary computation, 12 (4): 517--545","author":"Heckendorn R.","year":"2004","unstructured":"R. Heckendorn and A. Wright . Efficient linkage discovery by limited probing. Evolutionary computation, 12 (4): 517--545 , 2004 . R. Heckendorn and A. Wright. Efficient linkage discovery by limited probing. Evolutionary computation, 12 (4): 517--545, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/BFb0045375"},{"key":"e_1_3_2_1_12_1","first-page":"527","volume-title":"Lectures in the Science of Complexity","author":"Kauffman S.A.","year":"1989","unstructured":"S.A. Kauffman . Adaptation on Rugged Fitness Landscapes . In D.L. Stein, editor, Lectures in the Science of Complexity , pages 527 -- 618 . Addison-Wesley , 1989 . S.A. Kauffman. Adaptation on Rugged Fitness Landscapes. In D.L. Stein, editor, Lectures in the Science of Complexity, pages 527--618. Addison-Wesley, 1989."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195079517.001.0001","volume-title":"The Origins of Order","author":"Kauffman S.A.","year":"1993","unstructured":"S.A. Kauffman . The Origins of Order . Oxford Press , 1993 . S.A. Kauffman. The Origins of Order. Oxford Press, 1993."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1389095.1389204"},{"issue":"1","key":"e_1_3_2_1_15_1","first-page":"47","volume":"12","author":"Rowe J.","year":"2004","unstructured":"J. Rowe , D. Whitley , L. Barbulescu , and J.P. Watson . Properties of Gray and binary representations. Evolutionary computation , 12 ( 1 ): 47 -- 76 , 2004 J. Rowe, D. Whitley, L. Barbulescu, and J.P. Watson. Properties of Gray and binary representations. Evolutionary computation, 12 (1): 47--76, 2004","journal-title":"Properties of Gray and binary representations. Evolutionary computation"},{"key":"e_1_3_2_1_16_1","first-page":"44","volume-title":"The National Conference on Artificial Intelligence (AAAI)","author":"Selman B.","year":"1992","unstructured":"B. Selman , H. Levesque , and D. Mitchell . A New Method for Solving Hard Satisfiability Problems . In The National Conference on Artificial Intelligence (AAAI) , pages 44 -- 446 , San Jose, CA , 1992 . B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In The National Conference on Artificial Intelligence (AAAI), pages 44--446, San Jose, CA, 1992."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/978-3-030-58115-2_48"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_19_1","first-page":"1357","volume-title":"Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. In Genetic and Evolutionary Computation Conference (GECCO)","author":"Whitley D.","year":"2012","unstructured":"D. Whitley and W. Chen . Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. In Genetic and Evolutionary Computation Conference (GECCO) , pages 1357 -- 1364 . ACM, 2012 . D. Whitley and W. Chen. Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. In Genetic and Evolutionary Computation Conference (GECCO), pages 1357--1364. ACM, 2012."},{"key":"e_1_3_2_1_20_1","first-page":"760","volume-title":"Genetic and Evolutionary Computation Conference (GECCO)","author":"Whitley D.","year":"2020","unstructured":"D. Whitley , H. Aguirre and A. Sutton Understanding transforms of pseudoboolean functions . In Genetic and Evolutionary Computation Conference (GECCO) , pages 760 -- 768 . ACM, 2020 . D. Whitley, H. Aguirre and A. Sutton Understanding transforms of pseudoboolean functions. In Genetic and Evolutionary Computation Conference (GECCO), pages 760--768. ACM, 2020."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.5555\/2891460.2891591"},{"key":"e_1_3_2_1_22_1","first-page":"992","volume-title":"D. Whitley A Tractible Walsh Analysis of SAT and Its Implications for Genetic Algorithms. In The National Conference on Artificial Intelligence (AAAI)","author":"Rana S.","year":"1998","unstructured":"S. Rana , R. Heckendorn , D. Whitley A Tractible Walsh Analysis of SAT and Its Implications for Genetic Algorithms. In The National Conference on Artificial Intelligence (AAAI) , pages 992 -- 997 , 1998 . S. Rana, R. Heckendorn, D. Whitley A Tractible Walsh Analysis of SAT and Its Implications for Genetic Algorithms. In The National Conference on Artificial Intelligence (AAAI), pages 992--997, 1998."},{"key":"e_1_3_2_1_24_1","first-page":"71","volume":"17","author":"Rosenberg I.G.","year":"1975","unstructured":"I.G. Rosenberg . Reduction of bivalent maximization to the quadratic case. Cahiers Centre Etudes Rech. Oper. 17 : 71 -- 74 , 1975 . I.G. Rosenberg. Reduction of bivalent maximization to the quadratic case. Cahiers Centre Etudes Rech. Oper. 17:71--74, 1975.","journal-title":"Cahiers Centre Etudes Rech. Oper."}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '21","name":"GECCO '21: Genetic and Evolutionary Computation Conference","location":"Lille France"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459325","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":23,"alternative-id":["10.1145\/3449639.3459325","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459325","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}