{"id":"https://openalex.org/W2053987102","doi":"https://doi.org/10.1145/1967654.1967661","title":"Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics","display_name":"Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics","publication_year":2011,"publication_date":"2011-01-05","ids":{"openalex":"https://openalex.org/W2053987102","doi":"https://doi.org/10.1145/1967654.1967661","mag":"2053987102"},"language":"en","primary_location":{"id":"doi:10.1145/1967654.1967661","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1967654.1967661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015133105","display_name":"Greg Durrett","orcid":"https://orcid.org/0000-0002-7061-7298"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg Durrett","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["University of Adelaide, Adelaide, Australia","[University of Adelaide, Adelaide, Australia]"],"affiliations":[{"raw_affiliation_string":"University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"[University of Adelaide, Adelaide, Australia]","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000646181","display_name":"Una-May O\u2019Reilly","orcid":"https://orcid.org/0000-0001-6923-8445"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Una-May O'Reilly","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015133105"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":7.2688,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.96990957,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"69","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9769999980926514,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.7409452199935913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6908609867095947},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6689932346343994},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6298868656158447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5214871168136597},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5108632445335388},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47945085167884827},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.46255579590797424},{"id":"https://openalex.org/keywords/computational-problem","display_name":"Computational problem","score":0.4470514953136444},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.43648621439933777},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.43424856662750244},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2895974814891815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2807629108428955},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22841894626617432},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2174270749092102}],"concepts":[{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.7409452199935913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6908609867095947},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6689932346343994},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6298868656158447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5214871168136597},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5108632445335388},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47945085167884827},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.46255579590797424},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.4470514953136444},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.43648621439933777},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.43424856662750244},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2895974814891815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2807629108428955},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22841894626617432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2174270749092102},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1967654.1967661","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1967654.1967661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/70655","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/70655","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/1967654.1967661","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W93211624","https://openalex.org/W205027881","https://openalex.org/W1496078445","https://openalex.org/W1501396369","https://openalex.org/W1510977876","https://openalex.org/W1517016597","https://openalex.org/W1553838525","https://openalex.org/W1576818901","https://openalex.org/W1587463421","https://openalex.org/W2008990655","https://openalex.org/W2022793777","https://openalex.org/W2053175541","https://openalex.org/W2097724176","https://openalex.org/W2100137329","https://openalex.org/W2153401898","https://openalex.org/W2156184725","https://openalex.org/W2161238506","https://openalex.org/W2165220807"],"related_works":["https://openalex.org/W2092211394","https://openalex.org/W2009525028","https://openalex.org/W4321064619","https://openalex.org/W2140698704","https://openalex.org/W2091246427","https://openalex.org/W2029013302","https://openalex.org/W2559572301","https://openalex.org/W1589480767","https://openalex.org/W1523210215","https://openalex.org/W2163787533"],"abstract_inverted_index":{"Analyzing":[0],"the":[1,26,77,86],"computational":[2,27],"complexity":[3,28],"of":[4,17,30,53,59,71,79,88],"evolutionary":[5],"algorithms":[6,40],"(EAs)":[7],"for":[8],"binary":[9],"search":[10],"spaces":[11],"has":[12],"significantly":[13],"informed":[14],"our":[15],"understanding":[16],"EAs":[18],"in":[19,75],"general.":[20],"With":[21],"this":[22],"paper,":[23],"we":[24],"start":[25],"analysis":[29],"genetic":[31],"programming":[32],"(GP).":[33],"We":[34],"set":[35],"up":[36],"several":[37],"simplified":[38],"GP":[39,61,72],"and":[41,50,85],"analyze":[42],"them":[43],"on":[44],"two":[45],"separable":[46],"model":[47],"problems,":[48],"ORDER":[49],"MAJORITY,":[51],"each":[52],"which":[54],"captures":[55],"a":[56,89],"relevant":[57],"facet":[58],"typical":[60],"problems.":[62],"Both":[63],"analyses":[64],"give":[65],"first":[66],"rigorous":[67],"insights":[68],"into":[69],"aspects":[70],"design,":[73],"highlighting":[74],"particular":[76],"impact":[78],"accepting":[80],"or":[81],"rejecting":[82],"neutral":[83],"moves":[84],"importance":[87],"local":[90],"mutation":[91],"operator.":[92]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
