{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:05:19Z","timestamp":1767182719272,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T00:00:00Z","timestamp":1294185600000},"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":[[2011,1,5]]},"DOI":"10.1145\/1967654.1967661","type":"proceedings-article","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T12:01:35Z","timestamp":1302609695000},"page":"69-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics"],"prefix":"10.1145","author":[{"given":"Greg","family":"Durrett","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Una-May","family":"O'Reilly","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.34"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"16","volume-title":"Proceedings of the First European Workshop on Genetic Programming","author":"Goldberg D. E.","year":"1998","unstructured":"D. E. Goldberg and U.-M. O'Reilly . Where does the good stuff go, and why? how contextual semantics influence program structure in simple genetic programming . In W. Banzhaf, R. Poli, M. Schoenauer, and T. C. Fogarty, editors, Proceedings of the First European Workshop on Genetic Programming , volume 1391 of LNCS , pages 16 -- 36 , Paris, 14-15 Apr. 1998 . Springer-Verlag . D. E. Goldberg and U.-M. O'Reilly. Where does the good stuff go, and why? how contextual semantics influence program structure in simple genetic programming. In W. Banzhaf, R. Poli, M. Schoenauer, and T. C. Fogarty, editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 16--36, Paris, 14-15 Apr. 1998. Springer-Verlag."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974841"},{"key":"e_1_3_2_1_5_1","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"Koza J. R.","year":"1992","unstructured":"J. R. Koza . Genetic Programming: On the Programming of Computers by Means of Natural Selection . MIT Press , Cambridge, MA, USA , 1992 . J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992."},{"key":"e_1_3_2_1_6_1","volume-title":"Genetic Programming II: Automatic Discovery of Reusable Programs","author":"Koza J. R.","year":"1994","unstructured":"J. R. Koza . Genetic Programming II: Automatic Discovery of Reusable Programs . MIT Press , Cambridge Massachusetts , May 1994 . J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts, May 1994."},{"key":"e_1_3_2_1_7_1","first-page":"15","volume-title":"Proc. of PPSN '92","author":"H.","year":"1992","unstructured":"H. Mühlenbein. How genetic algorithms really work: mutation and hillclimbing . In Proc. of PPSN '92 , pages 15 -- 26 . Elsevier , 1992 . H. Mühlenbein. How genetic algorithms really work: mutation and hillclimbing. In Proc. of PPSN '92, pages 15--26. Elsevier, 1992."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102403076"},{"key":"e_1_3_2_1_9_1","volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann F.","year":"2010","unstructured":"F. Neumann and C. Witt . Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity . Springer , 2010 . F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, 2010."},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-58484-6_283","volume-title":"Y. Davidor, H.-P","author":"O'Reilly U.-M.","year":"1994","unstructured":"U.-M. O'Reilly and F. Oppacher . Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing . In Y. Davidor, H.-P . Schwefel, and R. Manner, editors, Parallel Problem Solving from Nature - PPSN III, number 866 in Lecture Notes in Computer Science , pages 397 -- 406 , Jerusalem, 9-14 Oct. 1994 . Springer-Verlag . U.-M. O'Reilly and F. Oppacher. Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors, Parallel Problem Solving from Nature - PPSN III, number 866 in Lecture Notes in Computer Science, pages 397--406, Jerusalem, 9-14 Oct. 1994. Springer-Verlag."},{"key":"e_1_3_2_1_12_1","first-page":"23","volume-title":"P. J. Angeline and K. E. Kinnear","author":"O'Reilly U.-M.","year":"1996","unstructured":"U.-M. O'Reilly and F. Oppacher . A comparative analysis of GP . In P. J. Angeline and K. E. Kinnear , Jr., editors, Advances in Genetic Programming 2, chapter 2, pages 23 -- 44 . MIT Press , Cambridge, MA, USA, 1996 . U.-M. O'Reilly and F. Oppacher. A comparative analysis of GP. In P. J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 2, pages 23--44. MIT Press, Cambridge, MA, USA, 1996."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-010-9110-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646975.711521"},{"key":"e_1_3_2_1_15_1","volume-title":"Convergence properties of evolutionary algorithms","author":"Rudolph G.","year":"1997","unstructured":"G. Rudolph . Convergence properties of evolutionary algorithms . Hamburg : Kova ïć, 1997 . G. Rudolph. Convergence properties of evolutionary algorithms. Hamburg: Kovaïć, 1997."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"}],"event":{"name":"FOGA '11: Foundations of Genetic Algorithms XI","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Schwarzenberg Austria","acronym":"FOGA '11"},"container-title":["Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1967654.1967661","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1967654.1967661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:29Z","timestamp":1750243949000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1967654.1967661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,5]]},"references-count":15,"alternative-id":["10.1145\/1967654.1967661","10.1145\/1967654"],"URL":"https:\/\/doi.org\/10.1145\/1967654.1967661","relation":{},"subject":[],"published":{"date-parts":[[2011,1,5]]},"assertion":[{"value":"2011-01-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}