{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:00Z","timestamp":1750307040397,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"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.2214004","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"277-288","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["2\n            <sup>\n              log1-\u03b5\n              <i>n<\/i>\n            <\/sup>\n            hardness for the closest vector problem with preprocessing"],"prefix":"10.1145","author":[{"given":"Subhash A.","family":"Khot","sequence":"first","affiliation":[{"name":"New York University, New York, NY, USA"}]},{"given":"Preyas","family":"Popat","sequence":"additional","affiliation":[{"name":"New York University, New York, NY, USA"}]},{"given":"Nisheeth K.","family":"Vishnoi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.1006\/jcss.1997.1472"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1109\/SFCS.2005.40"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.1007\/s00037-011-0031-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.1145\/278298.278306"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1145\/1089023.1089025"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1145\/273865.273901"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1007\/s00493-003-0025-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1007\/s00493-003-0019-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.5555\/1747597.1748055"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1016\/j.jcss.2004.01.002"},{"key":"e_1_3_2_2_11_1","volume-title":"Bypassing UGC from some optimal geometric inapproximability results. Electronic Colloquium on Computational Complexity (ECCC), 17:177","author":"Guruswami Venkatesan","year":"2010","unstructured":"Venkatesan Guruswami , Prasad Raghavendra , Rishi Saket , and Yi Wu . Bypassing UGC from some optimal geometric inapproximability results. Electronic Colloquium on Computational Complexity (ECCC), 17:177 , 2010 . Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, and Yi Wu. Bypassing UGC from some optimal geometric inapproximability results. Electronic Colloquium on Computational Complexity (ECCC), 17:177, 2010."},{"key":"e_1_3_2_2_12_1","first-page":"23","volume-title":"Hardness results for coloring 3-colorable 3-uniform hypergraphs. In 43$^rd$ IEEE FOCS","author":"Khot S.","year":"2002","unstructured":"S. Khot . Hardness results for coloring 3-colorable 3-uniform hypergraphs. In 43$^rd$ IEEE FOCS , pages 23 -- 32 , 2002 . S. Khot. Hardness results for coloring 3-colorable 3-uniform hypergraphs. In 43$^rd$ IEEE FOCS, pages 23--32, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.1007\/11786986_21"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.1016\/j.jcss.2010.06.010"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_15_1","DOI":"10.1145\/146585.146605"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.1007\/BF02128669"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1145\/1806689.1806739"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_18_1","DOI":"10.1137\/S0097539795280895"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_19_1","DOI":"10.1109\/TIT.2004.833350"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.1145\/1132516.1132581"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1145\/258533.258641"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_22_1","DOI":"10.1016\/0304-3975(87)90064-8"}],"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.2214004","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214004","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.2214004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":22,"alternative-id":["10.1145\/2213977.2214004","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214004","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"}}]}}