{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:46Z","timestamp":1750306966977,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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,6]]},"DOI":"10.1145\/2488608.2488666","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"457-466","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximation resistance on satisfiable instances for predicates with few accepting inputs"],"prefix":"10.1145","author":[{"given":"Sangxia","family":"Huang","sequence":"first","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"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.1109\/CCC.2012.18"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0272-6"},{"key":"e_1_3_2_1_5_1","volume-title":"Approximation resistance from pairwise independent subgroups. Electronic Colloquium on Computational Complexity (ECCC), 19:110","author":"Chan S. O.","year":"2012","unstructured":"S. O. Chan . Approximation resistance from pairwise independent subgroups. Electronic Colloquium on Computational Complexity (ECCC), 19:110 , 2012 . S. O. Chan. Approximation resistance from pairwise independent subgroups. Electronic Colloquium on Computational Complexity (ECCC), 19:110, 2012."},{"key":"e_1_3_2_1_6_1","volume-title":"Approximation algorithm for the Max k-CSP problem. Electronic Colloquium on Computational Complexity (ECCC), 13(063)","author":"Charikar M.","year":"2006","unstructured":"M. Charikar , K. Makarychev , and Y. Makarychev . Approximation algorithm for the Max k-CSP problem. Electronic Colloquium on Computational Complexity (ECCC), 13(063) , 2006 . M. Charikar, K. Makarychev, and Y. Makarychev. Approximation algorithm for the Max k-CSP problem. Electronic Colloquium on Computational Complexity (ECCC), 13(063), 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704443057"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176345462"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v33:4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748055"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095174"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2005.v001a007"},{"key":"e_1_3_2_1_17_1","volume-title":"Approximation resistance on satisfiable instances for predicates strictly dominating parity. Electronic Colloquium on Computational Complexity (ECCC), 19:40","author":"Huang S.","year":"2012","unstructured":"S. Huang . Approximation resistance on satisfiable instances for predicates strictly dominating parity. Electronic Colloquium on Computational Complexity (ECCC), 19:40 , 2012 . S. Huang. Approximation resistance on satisfiable instances for predicates strictly dominating parity. Electronic Colloquium on Computational Complexity (ECCC), 19:40, 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652134"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993692"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-010-0047-x"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.53"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214005"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536482"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335329"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132519"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/070681612"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_93"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010035"},{"key":"e_1_3_2_1_31_1","volume-title":"Manuscript","author":"Wenner C.","year":"2012","unstructured":"C. Wenner . Circumventing d-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width four . Manuscript , 2012 . C. Wenner. Circumventing d-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width four. Manuscript, 2012."},{"key":"e_1_3_2_1_32_1","first-page":"325","volume-title":"APPROX-RANDOM","author":"Wenner C.","year":"2012","unstructured":"C. Wenner . Circumventing d-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width four - (extended abstract) . In APPROX-RANDOM , pages 325 -- 337 , 2012 . C. Wenner. Circumventing d-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width four - (extended abstract). In APPROX-RANDOM, pages 325--337, 2012."},{"key":"e_1_3_2_1_33_1","first-page":"201","volume-title":"SODA","author":"Zwick U.","year":"1998","unstructured":"U. Zwick . Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint . In SODA , pages 201 -- 210 , 1998 . U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In SODA, pages 201--210, 1998."}],"event":{"name":"STOC'13: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Palo Alto California USA","acronym":"STOC'13"},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488666","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":32,"alternative-id":["10.1145\/2488608.2488666","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488666","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}