{"id":"https://openalex.org/W2040194491","doi":"https://doi.org/10.1145/100216.100274","title":"On the complexity of local search","display_name":"On the complexity of local search","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2040194491","doi":"https://doi.org/10.1145/100216.100274","mag":"2040194491"},"language":"en","primary_location":{"id":"doi:10.1145/100216.100274","doi":"https://doi.org/10.1145/100216.100274","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100274","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100274","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100274","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103200572","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0004-6462-2316","observed_orcids":["https://orcid.org/0009-0004-6462-2316"]},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. H. Papadimitriou","raw_affiliation_strings":["Department of Computer Science and Engineering, University of California at San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of California at San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000317216","display_name":"Alejandro A. Sch\u00e4ffer","orcid":"https://orcid.org/0000-0002-2147-8033","observed_orcids":["https://orcid.org/0000-0002-2147-8033"]},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. A. Sch\u00e4ffer","raw_affiliation_strings":["Department of Computer Science, Rice University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rice University","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860","observed_orcids":["https://orcid.org/0000-0003-2857-1860"]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Yannakakis","raw_affiliation_strings":["AT&T Bell Laboratories","AT&T Bell Labs.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Bell Labs.#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.837,"has_fulltext":true,"cited_by_count":108,"citation_normalized_percentile":{"value":0.91111111,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"438","last_page":"445"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.004999999888241291,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0010999999940395355,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.9449999928474426},{"id":"https://openalex.org/keywords/local-optimality","display_name":"local optimality","score":0.7860000133514404},{"id":"https://openalex.org/keywords/pls-completeness","display_name":"PLS-completeness","score":0.9179999828338623},{"id":"https://openalex.org/keywords/p-complete-problems","display_name":"#P-complete problems","score":0.7390000224113464},{"id":"https://openalex.org/keywords/pspace-completeness","display_name":"PSPACE-completeness","score":0.9210000038146973},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.8240000009536743},{"id":"https://openalex.org/keywords/lin-kernighan-heuristic","display_name":"Lin-Kernighan heuristic","score":0.996999979019165},{"id":"https://openalex.org/keywords/hopfield-neural-network","display_name":"Hopfield neural network","score":0.9330000281333923},{"id":"https://openalex.org/keywords/stable-configurations","display_name":"stable configurations","score":0.7400000095367432},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.4449999928474426},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.6679999828338623}],"concepts":[{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.8046801090240479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6455188989639282},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.3451300859451294},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3433286249637604},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16742780804634094}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/100216.100274","doi":"https://doi.org/10.1145/100216.100274","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100274","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100274","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.455.8739","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.455.8739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.karlin.mff.cuni.cz/~krajicek/jpy2.pdf","raw_type":"text"},{"id":"mag:2166982222","doi":null,"is_oa":false,"landing_page_url":"https://cse.unl.edu/~seth/434/Web%20Links%20and%20Docs/complexity%20of%20K-L-papadimitriou.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on the Theory of Computing","raw_type":null}],"best_oa_location":{"id":"doi:10.1145/100216.100274","doi":"https://doi.org/10.1145/100216.100274","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100274","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100274","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310133","display_name":"Rice University","ror":"https://ror.org/008zs3103"},{"id":"https://openalex.org/F4320320882","display_name":"Volkswagen Foundation","ror":"https://ror.org/03bsmfz84"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2040194491.pdf","grobid_xml":"https://content.openalex.org/works/W2040194491.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1597286183","https://openalex.org/W1753541634","https://openalex.org/W1767277406","https://openalex.org/W1826176242","https://openalex.org/W1973735752","https://openalex.org/W1980813953","https://openalex.org/W2011039300","https://openalex.org/W2026143151","https://openalex.org/W2042986967","https://openalex.org/W2045173407","https://openalex.org/W2062459871","https://openalex.org/W2069323107","https://openalex.org/W2071134069","https://openalex.org/W2100061495","https://openalex.org/W2103981148","https://openalex.org/W2121956325","https://openalex.org/W2128084896","https://openalex.org/W2161455936","https://openalex.org/W2167469500","https://openalex.org/W3152126650","https://openalex.org/W4241584151","https://openalex.org/W6675583862","https://openalex.org/W6813822364"],"related_works":["https://openalex.org/W2047820376","https://openalex.org/W2062459871","https://openalex.org/W2093399001","https://openalex.org/W2103981148","https://openalex.org/W2121956325","https://openalex.org/W1767277406","https://openalex.org/W2184552291","https://openalex.org/W2031178115","https://openalex.org/W7138909063","https://openalex.org/W2022102208"],"abstract_inverted_index":{"We":[0,44,57],"prove":[1],"a":[2,20,47,59,93,116,126],"number":[3],"of":[4,11,49,124],"complexity":[5],"results":[6,15],"on":[7],"the":[8,24,28,40,83,122,130,134],"computational":[9],"paradigm":[10],"local":[12,21,52,68,74,84,90,127],"optimality.Our":[13],"main":[14],"are":[16,55],"these:":[17],"(a)":[18],"Finding":[19,33],"optimum":[22,85,128],"under":[23],"Lin-Kernighan":[25],"heuristic":[26,132],"for":[27,62,67,133],"traveling":[29],"salesman":[30],"problemis":[31],"PLS-complete.(b)":[32],"stable":[34],"configurations":[35],"in":[36,39,112,129],"neural":[37],"networks":[38],"Hopfield":[41],"mode/is":[42],"PLS-complete.(c)":[43],"show":[45,72],"that":[46,73,82],"host":[48],"simple":[50],"unweighted":[51],"optimality":[53],"problems":[54,76,99],"P-complete.(d)":[56],"introduce":[58],"general":[60],"framework":[61],"establishing":[63],"exponential":[64],"worstcase":[65],"bounds":[66],"optimization":[69],"heuristics.(e)And":[70],"we":[71,80],"search":[75],"become":[77],"PSPACE-complete":[78],"if":[79],"insist":[81],"returned":[86],"be":[87,103],"attainable":[88],"by":[89],"improvements":[91],"from":[92],"given":[94],"initial":[95],"solution.In":[96],"[JPY]":[97],"two":[98],"were":[100,115],"shown":[101],"to":[102],"PLScomplete":[104],"and":[105,121],"thus":[106],"as":[107,109],"hard":[108],"any":[110],"problem":[111,118,123,137],"PLS;":[113],"they":[114],"\"generic\"":[117],"called":[119],"FLIP,":[120],"finding":[125],"Kernighan-Lin":[131],"graph":[135],"partitioning":[136],"[KL].":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}