{"id":"https://openalex.org/W3035284786","doi":"https://doi.org/10.1145/3357713.3384325","title":"Smoothed complexity of local max-cut and binary max-CSP","display_name":"Smoothed complexity of local max-cut and binary max-CSP","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035284786","doi":"https://doi.org/10.1145/3357713.3384325","mag":"3035284786"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384325","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100329931","display_name":"Xi Chen","orcid":"https://orcid.org/0000-0002-3135-4114"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xi Chen","raw_affiliation_strings":["Columbia University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037879765","display_name":"Chenghao Guo","orcid":null},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chenghao Guo","raw_affiliation_strings":["Tsinghua University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063068322","display_name":"Emmanouil-Vasileios Vlatakis-Gkaragkounis","orcid":"https://orcid.org/0009-0009-7549-538X"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emmanouil V. Vlatakis-Gkaragkounis","raw_affiliation_strings":["Columbia University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["Columbia University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101780776","display_name":"Xinzhi Zhang","orcid":"https://orcid.org/0000-0003-3479-9327"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinzhi Zhang","raw_affiliation_strings":["Tsinghua University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1707,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7475147,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1052","last_page":"1065"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/maximum-cut","display_name":"Maximum cut","score":0.7268688678741455},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6828819513320923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6650535464286804},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6386812329292297},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5755174160003662},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5625740885734558},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5487011075019836},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5059508681297302},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.48526880145072937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4483337998390198},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.416289746761322},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3701731562614441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30543971061706543},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0981685221195221},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06862935423851013},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.05739489197731018}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7268688678741455},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6828819513320923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6650535464286804},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6386812329292297},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5755174160003662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5625740885734558},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5487011075019836},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5059508681297302},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.48526880145072937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4483337998390198},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.416289746761322},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3701731562614441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30543971061706543},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0981685221195221},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06862935423851013},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.05739489197731018},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384325","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5828417489","display_name":null,"funder_award_id":"1838154, 1703925, 1763970, 1814873, 1563155","funder_id":"https://openalex.org/F4320315254","funder_display_name":"Innovative Research Group Project of the National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320315254","display_name":"Innovative Research Group Project of the National Natural Science Foundation of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1982562599","https://openalex.org/W2034053794","https://openalex.org/W2103981148","https://openalex.org/W2128084896","https://openalex.org/W2145297839","https://openalex.org/W2295408917","https://openalex.org/W2536358984","https://openalex.org/W2884656905","https://openalex.org/W3160805239","https://openalex.org/W4210896998"],"related_works":["https://openalex.org/W3020890412","https://openalex.org/W1524973174","https://openalex.org/W2580986343","https://openalex.org/W2102858635","https://openalex.org/W1588356204","https://openalex.org/W2046178780","https://openalex.org/W1499428733","https://openalex.org/W1565732763","https://openalex.org/W2807251790","https://openalex.org/W2023722467"],"abstract_inverted_index":{"We":[0,97],"show":[1],"that":[2,34,74],"the":[3,7,22,27,36,47,94,100,105],"smoothed":[4,106],"complexity":[5,107],"of":[6,24,38,52,67,70,108],"FLIP":[8,109],"algorithm":[9],"for":[10,79],"local":[11],"Max-Cut":[12],"is":[13,21,31,62,76],"at":[14],"most":[15],"\u03c6":[16,30,53],"n":[17,20,54],"O(\u221alogn),":[18],"where":[19],"number":[23],"nodes":[25],"in":[26,82,93],"graph":[28],"and":[29,58],"a":[32,83,88],"parameter":[33],"measures":[35],"magnitude":[37],"perturbations":[39],"applied":[40],"on":[41,64,104],"its":[42],"edge":[43],"weights.":[44],"This":[45],"improves":[46],"previously":[48],"best":[49],"upper":[50,102],"bound":[51,103],"O(logn)":[55],"by":[56],"Etscheid":[57],"Roglin.":[59],"Our":[60],"result":[61],"based":[63],"an":[65],"analysis":[66],"long":[68,84],"sequences":[69],"flips,":[71],"which":[72],"shows":[73],"it":[75],"very":[77],"unlikely":[78],"every":[80],"flip":[81],"sequence":[85],"to":[86,110],"incur":[87],"positive":[89],"but":[90],"small":[91],"improvement":[92],"cut":[95],"weight.":[96],"also":[98],"extend":[99],"same":[101],"all":[111],"binary":[112],"Maximum":[113],"Constraint":[114],"Satisfaction":[115],"Problems.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}