{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T16:39:44Z","timestamp":1785170384126,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1617730"],"award-info":[{"award-number":["1617730"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188968","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"44-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["A converse to Banach's fixed point theorem and its CLS-completeness"],"prefix":"10.1145","author":[{"given":"Constantinos","family":"Daskalakis","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manolis","family":"Zampetakis","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055402"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Aharon Ben-Tal and Arkadi Nemirovski. 2001. Lectures on modern convex optimization: analysis algorithms and engineering applications. SIAM.   Aharon Ben-Tal and Arkadi Nemirovski. 2001. Lectures on modern convex optimization: analysis algorithms and engineering applications. SIAM.","DOI":"10.1137\/1.9780898718829"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.4064\/cm-7-1-41-43"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.94"},{"key":"e_1_3_2_2_5_1","volume-title":"Convex optimization","author":"Boyd Stephen"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_2_7_1","volume-title":"The contraction mapping theorem. Expository paper","author":"Conrad Keith","year":"2014"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133098"},{"key":"e_1_3_2_2_10_1","volume-title":"A Converse to Banach\u2019s Fixed Point Theorem and its CLS Completeness. arXiv preprint arXiv:1702.07339","author":"Daskalakis Constantinos","year":"2017"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.48"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3011870"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_2_14_1","volume-title":"CLS: New Problems and Completeness. arXiv preprint arXiv:1702.06017","author":"Fearnley John","year":"2017"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"e_1_3_2_2_16_1","volume-title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1352\u20131371","author":"Hubacek Pavel","year":"2017"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_2_18_1","first-page":"15","article-title":"White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing","volume":"24","author":"Komargodski Ilan","year":"2017","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the 29th Conference on Learning Theory, COLT 2016","author":"Lee Jason D.","year":"2016"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.014"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","volume-title":"Introductory lectures on convex optimization: A basic course","author":"Nesterov Yurii","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"e_1_3_2_2_22_1","volume-title":"Gradient Descent Converges to Minimizers: The Case of Non-Isolated Critical Points. CoRR abs\/1605.00405","author":"Panageas Ioannis","year":"2016"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_2_2_24_1","first-page":"59","article-title":"Can PPAD Hardness be Based on Standard Cryptographic Assumptions?","volume":"23","author":"Rosen Alon","year":"2016","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_2_25_1","volume-title":"Foundations of Computer Science (FOCS)","author":"Rubinstein Aviad"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374428"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188968","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188968","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:07Z","timestamp":1750208887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":26,"alternative-id":["10.1145\/3188745.3188968","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188968","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}