{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T16:39:43Z","timestamp":1785170383543,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1838154, 1703925, 1763970, 1814873, 1563155"],"award-info":[{"award-number":["1838154, 1703925, 1763970, 1814873, 1563155"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384325","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"1052-1065","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Smoothed complexity of local max-cut and binary max-CSP"],"prefix":"10.1145","author":[{"given":"Xi","family":"Chen","sequence":"first","affiliation":[{"name":"Columbia University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenghao","family":"Guo","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanouil V.","family":"Vlatakis-Gkaragkounis","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinzhi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055402"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310490"},{"key":"e_1_3_2_1_3_1","volume-title":"Smoothed Eficient Algorithms and Reductions for Network Coordination Games. CoRR abs\/","author":"Boodaghians Shant","year":"1809","unstructured":"Shant Boodaghians , Rucha Kulkarni , and Ruta Mehta . 2019. Smoothed Eficient Algorithms and Reductions for Network Coordination Games. CoRR abs\/ 1809 .02280v4 ( 2019 ). arXiv: 1809.02280 http:\/\/arxiv.org\/abs\/ 1809.02280v4 Shant Boodaghians, Rucha Kulkarni, and Ruta Mehta. 2019. Smoothed Eficient Algorithms and Reductions for Network Coordination Games. CoRR abs\/ 1809.02280v4 ( 2019 ). arXiv: 1809.02280 http:\/\/arxiv.org\/abs\/ 1809.02280v4"},{"key":"e_1_3_2_1_4_1","volume-title":"Smoothed complexity of local Max-Cut and binary Max-CSP. arXiv:cs.DS\/","author":"Chen Xi","year":"1911","unstructured":"Xi Chen , Chenghao Guo , Emmanouil-Vasileios Vlatakis-Gkaragkounis , Mihalis Yannakakis , and Xinzhi Zhang . 2019. Smoothed complexity of local Max-Cut and binary Max-CSP. arXiv:cs.DS\/ 1911 .10381 Xi Chen, Chenghao Guo, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Mihalis Yannakakis, and Xinzhi Zhang. 2019. Smoothed complexity of local Max-Cut and binary Max-CSP. arXiv:cs.DS\/ 1911.10381"},{"key":"e_1_3_2_1_5_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Els\u00e4sser Robert","unstructured":"Robert Els\u00e4sser and Tobias Tscheuschner . 2011. Settling the complexity of local max-cut (almost) completely . In International Colloquium on Automata, Languages, and Programming . Springer , 171-182. Robert Els\u00e4sser and Tobias Tscheuschner. 2011. Settling the complexity of local max-cut (almost) completely. In International Colloquium on Automata, Languages, and Programming. Springer, 171-182."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_43"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3011870"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.79.8.2554"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_1_12_1","series-title":"SIAM journal on Computing 20, 1 ( 1991 ), 56-87","volume-title":"Simple local search problems that are hard to solve","author":"Sch\u00e4fer Alejandro A","unstructured":"Alejandro A Sch\u00e4fer and Mihalis Yannakakis . 1991. Simple local search problems that are hard to solve . SIAM journal on Computing 20, 1 ( 1991 ), 56-87 . Alejandro A Sch\u00e4fer and Mihalis Yannakakis. 1991. Simple local search problems that are hard to solve. SIAM journal on Computing 20, 1 ( 1991 ), 56-87."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Daniel A Spielman and Shanghua Teng. 2009. Smoothed analysis: an attempt to explain the behavior of algorithms in practice. parallel computing 52 10 ( 2009 ) 76-84.  Daniel A Spielman and Shanghua Teng. 2009. Smoothed analysis: an attempt to explain the behavior of algorithms in practice. parallel computing 52 10 ( 2009 ) 76-84.","DOI":"10.1145\/1562764.1562785"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384325","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:57Z","timestamp":1750199577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":13,"alternative-id":["10.1145\/3357713.3384325","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384325","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}