{"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":1750308711913,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"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.2422461","type":"proceedings-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T12:58:22Z","timestamp":1357217902000},"page":"215-220","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On the power of many one-bit provers"],"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":"Johan","family":"H\u00e5stad","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, 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.1145\/278298.278306"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195467"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.27"},{"key":"e_1_3_2_1_9_1","volume-title":"Approximation Resistance from Pairwise Independent Subgroups. Electronic Colloquium on Computational Complexity (ECCC), 19:110","author":"Chan Siu On","year":"2012","unstructured":"Siu On Chan . Approximation Resistance from Pairwise Independent Subgroups. Electronic Colloquium on Computational Complexity (ECCC), 19:110 , 2012 . Siu On Chan. Approximation Resistance from Pairwise Independent Subgroups. Electronic Colloquium on Computational Complexity (ECCC), 19:110, 2012."},{"key":"e_1_3_2_1_10_1","first-page":"581","volume-title":"ICALP (1)","author":"Drucker Andrew","year":"2011","unstructured":"Andrew Drucker . AprotectPCP characterization ofprotectAM . In ICALP (1) , pages 581 -- 592 , 2011 . Andrew Drucker. AprotectPCP characterization ofprotectAM. In ICALP (1), pages 581--592, 2011."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00116-1"},{"key":"e_1_3_2_1_12_1","first-page":"8","volume-title":"FOCS","author":"Guruswami Venkatesan","year":"1998","unstructured":"Venkatesan Guruswami , Daniel Lewin , Madhu Sudan , and Luca Trevisan . A tight characterization of np with 3 queryprotectPCPs . In FOCS , pages 8 -- 17 , 1998 . Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, and Luca Trevisan. A tight characterization of np with 3 queryprotectPCPs. In FOCS, pages 8--17, 1998."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-002-0169-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_16_1","first-page":"367","volume-title":"ICS","author":"Kale Satyen","year":"2011","unstructured":"Satyen Kale and C. Seshadhri . Combinatorial approximation algorithms for maxcut using random walks . In ICS , pages 367 -- 388 , 2011 . Satyen Kale and C. Seshadhri. Combinatorial approximation algorithms for maxcut using random walks. In ICS, pages 367--388, 2011."},{"key":"e_1_3_2_1_17_1","volume-title":"Approximation Algorithm for Non-Boolean MAX k-CSP. To appear in APPROX","author":"Makarychev Konstantin","year":"2012","unstructured":"Konstantin Makarychev and Yury Makarychev . Approximation Algorithm for Non-Boolean MAX k-CSP. To appear in APPROX , 2012 . Konstantin Makarychev and Yury Makarychev. Approximation Algorithm for Non-Boolean MAX k-CSP. To appear in APPROX, 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335329"},{"key":"e_1_3_2_1_19_1","first-page":"201","volume-title":"SODA","author":"Zwick Uri","year":"1998","unstructured":"Uri Zwick . Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint . In SODA , pages 201 -- 210 , 1998 . Uri Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In SODA, pages 201--210, 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.2422461","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2422436.2422461","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.2422461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":19,"alternative-id":["10.1145\/2422436.2422461","10.1145\/2422436"],"URL":"https:\/\/doi.org\/10.1145\/2422436.2422461","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"}}]}}