{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:51Z","timestamp":1750308711608,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"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":[[2013,1,9]]},"DOI":"10.1145\/2422436.2422459","type":"proceedings-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T12:58:22Z","timestamp":1357217902000},"page":"187-196","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A characterization of approximation resistance for even k-partite CSPs"],"prefix":"10.1145","author":[{"given":"Per","family":"Austrin","sequence":"first","affiliation":[{"name":"Aalto Science Institute and KTH Royal Institute of Technology, Helsinki and Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash","family":"Khot","sequence":"additional","affiliation":[{"name":"New York University and University of Chicago, New York and Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/100783534"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.18"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.20"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v33:4"},{"key":"e_1_3_2_1_5_1","first-page":"8","volume-title":"Proceedings of 39th Annual IEEE Symposium on Foundations of Computer Science","author":"Guruswami V.","year":"1998","unstructured":"V. Guruswami , D. Lewin , M. Sudan , and L. Trevisan . A tight characterization ofprotectNP with 3 queryprotectPCPs . In Proceedings of 39th Annual IEEE Symposium on Foundations of Computer Science , pages 8 -- 17 , Palo Alto , 1998 . IEEE. V. Guruswami, D. Lewin, M. Sudan, and L. Trevisan. A tight characterization ofprotectNP with 3 queryprotectPCPs. In Proceedings of 39th Annual IEEE Symposium on Foundations of Computer Science, pages 8--17, Palo Alto, 1998. IEEE."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_12"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2010.171.295"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-010-0047-x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374414"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.74"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335329"},{"key":"e_1_3_2_1_15_1","first-page":"59","article-title":"A decision method for elementary algebra and geometry","author":"Tarski A.","year":"1951","unstructured":"A. Tarski . A decision method for elementary algebra and geometry . Bulletin of the American Mathematical Society , 59 , 1951 . A. Tarski. A decision method for elementary algebra and geometry. Bulletin of the American Mathematical Society, 59, 1951.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"e_1_3_2_1_16_1","first-page":"201","volume-title":"Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Zwick U.","year":"1998","unstructured":"U. Zwick . Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint . In Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 201 -- 210 . ACM, 1998 . U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 201--210. ACM, 1998."}],"event":{"name":"ITCS '13: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Berkeley California USA","acronym":"ITCS '13"},"container-title":["Proceedings of the 4th conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422459","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2422436.2422459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:14Z","timestamp":1750277654000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":16,"alternative-id":["10.1145\/2422436.2422459","10.1145\/2422436"],"URL":"https:\/\/doi.org\/10.1145\/2422436.2422459","relation":{},"subject":[],"published":{"date-parts":[[2013,1,9]]},"assertion":[{"value":"2013-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}