{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:19Z","timestamp":1763468059397,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214005","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"289-306","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A new point of NP-hardness for unique games"],"prefix":"10.1145","author":[{"given":"Ryan","family":"O'Donnell","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]},{"given":"John","family":"Wright","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.1109\/FOCS.2010.59"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1006\/jagm.2000.1154"},{"key":"e_1_3_2_2_3_1","volume-title":"Manuscript","author":"Barak Boaz","year":"2011","unstructured":"Boaz Barak , Aram Harrow , Jonathan Kelner , David Steurer , and Yuan Zhou . Hypercontractive inequalities, sums of squares proofs, and their applications . Manuscript , 2011 . Boaz Barak, Aram Harrow, Jonathan Kelner, David Steurer, and Yuan Zhou. Hypercontractive inequalities, sums of squares proofs, and their applications. Manuscript, 2011."},{"key":"e_1_3_2_2_4_1","volume-title":"Randomness and Computation","author":"Ben-Or Michael","year":"1990","unstructured":"Michael Ben-Or and Nathan Linial . Collective coin flipping . In Silvio Micali, editor, Randomness and Computation . Academic Press , New York , 1990 . Michael Ben-Or and Nathan Linial. Collective coin flipping. In Silvio Micali, editor, Randomness and Computation. Academic Press, New York, 1990."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1109\/FOCS.2011.95"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.5555\/645901.672774"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1007\/978-3-540-28629-5_18"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1109\/FOCS.2009.8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.1137\/07068062X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.4007\/annals.2005.162.439"},{"doi-asserted-by":"crossref","unstructured":"Uriel\n      Feige\n    .\n  Randomized rounding of semidefinite programs -- variations on the Max-Cut example volume \n  1761\n   of \n  Lecture Notes in Computer Science pages \n  189\n  --\n  196\n  . \n  Springer 1999\n  .   Uriel Feige. Randomized rounding of semidefinite programs -- variations on the Max-Cut example volume 1761 of Lecture Notes in Computer Science pages 189--196. Springer 1999.","key":"e_1_3_2_2_11_1","DOI":"10.1007\/978-3-540-48413-4_20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.1145\/509907.509985"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.1145\/195058.195128"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.1007\/978-3-540-27821-4_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_15_1","DOI":"10.1109\/FOCS.2011.36"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.1145\/227683.227684"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1145\/258533.258536"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_18_1","DOI":"10.1007\/BF02392825"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_19_1","DOI":"10.1145\/502090.502098"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.1006\/jcss.2000.1727"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1145\/509907.510017"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_22_1","DOI":"10.1137\/S0097539705447372"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_23_1","DOI":"10.4086\/toc.2009.v005a004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_24_1","DOI":"10.1109\/CCC.2010.20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_25_1","DOI":"10.4007\/annals.2010.171.295"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_26_1","DOI":"10.1007\/s00039-010-0047-x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_27_1","DOI":"10.1145\/1754399.1754402"},{"key":"e_1_3_2_2_28_1","volume-title":"Approximating the maximum acyclic subgraph. Master's thesis","author":"Newman Alantha","year":"2000","unstructured":"Alantha Newman . Approximating the maximum acyclic subgraph. Master's thesis , Massachusetts Institute of Technology , 2000 . Alantha Newman. Approximating the maximum acyclic subgraph. Master's thesis, Massachusetts Institute of Technology, 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_29_1","DOI":"10.1145\/1374376.1374425"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_30_1","DOI":"10.1109\/CCC.2011.37"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_31_1","DOI":"10.1007\/s00493-006-0008-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_33_1","DOI":"10.1145\/225058.225181"},{"key":"e_1_3_2_2_34_1","volume-title":"Subexponential algorithms for d-to-1 two-prover games and for certifying almost perfect expansion. Available at the author's website","author":"Steurer David","year":"2010","unstructured":"David Steurer . Subexponential algorithms for d-to-1 two-prover games and for certifying almost perfect expansion. Available at the author's website , 2010 . David Steurer. Subexponential algorithms for d-to-1 two-prover games and for certifying almost perfect expansion. Available at the author's website, 2010."},{"key":"e_1_3_2_2_35_1","volume-title":"Personal communication","author":"Steurer David","year":"2011","unstructured":"David Steurer . Personal communication , 2011 . David Steurer. Personal communication, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_36_1","DOI":"10.1137\/S0097539797328847"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_37_1","DOI":"10.1145\/1536414.1536457"},{"key":"e_1_3_2_2_38_1","volume-title":"Personal communication","author":"Wu Yi","year":"2010","unstructured":"Yi Wu and Yuan Zhou . Personal communication , 2010 . Yi Wu and Yuan Zhou. Personal communication, 2010."},{"key":"e_1_3_2_2_39_1","first-page":"222","volume-title":"Proceedings of the 6th Annual Latin American Informatics Symposium","author":"Yang Ke","year":"2004","unstructured":"Ke Yang . On the (im)possibility of non-interactive correlation distillation . In Proceedings of the 6th Annual Latin American Informatics Symposium , pages 222 -- 231 , 2004 . Ke Yang. On the (im)possibility of non-interactive correlation distillation. In Proceedings of the 6th Annual Latin American Informatics Symposium, pages 222--231, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_40_1","DOI":"10.1016\/j.tcs.2007.03.007"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC'12","name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214005","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":39,"alternative-id":["10.1145\/2213977.2214005","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214005","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}