{"id":"https://openalex.org/W2405285952","doi":"https://doi.org/10.1145/2873054","title":"Approximation Resistance from Pairwise-Independent Subgroups","display_name":"Approximation Resistance from Pairwise-Independent Subgroups","publication_year":2016,"publication_date":"2016-08-12","ids":{"openalex":"https://openalex.org/W2405285952","doi":"https://doi.org/10.1145/2873054","mag":"2405285952"},"language":"en","primary_location":{"id":"doi:10.1145/2873054","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2873054","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100856892","display_name":"Siu On Chan","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Siu On Chan","raw_affiliation_strings":["University of California, Berkeley","University of California\u2013Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California\u2013Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100856892"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.05499251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"63","issue":"3","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.977400004863739,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7931951284408569},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6145786046981812},{"id":"https://openalex.org/keywords/pairwise-independence","display_name":"Pairwise independence","score":0.5912793874740601},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5713805556297302},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5664003491401672},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5653392672538757},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5549015402793884},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5146442651748657},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.5050283074378967},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4933747351169586},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4349965751171112},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.25090885162353516},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.1531321406364441},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1018470823764801},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09001865983009338}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7931951284408569},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6145786046981812},{"id":"https://openalex.org/C114928208","wikidata":"https://www.wikidata.org/wiki/Q17104952","display_name":"Pairwise independence","level":5,"score":0.5912793874740601},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5713805556297302},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5664003491401672},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5653392672538757},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5549015402793884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5146442651748657},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.5050283074378967},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4933747351169586},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4349965751171112},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25090885162353516},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.1531321406364441},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1018470823764801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09001865983009338},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C182514268","wikidata":"https://www.wikidata.org/wiki/Q7636889","display_name":"Sum of normally distributed random variables","level":4,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2873054","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2873054","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"mag:2405285952","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2012/110","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4787339945","display_name":null,"funder_award_id":"DMS-1106999","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":65,"referenced_works":["https://openalex.org/W105587991","https://openalex.org/W1491127810","https://openalex.org/W1492972816","https://openalex.org/W1586488998","https://openalex.org/W1868897294","https://openalex.org/W1967344706","https://openalex.org/W1968556476","https://openalex.org/W1970259241","https://openalex.org/W1973898585","https://openalex.org/W1979790324","https://openalex.org/W1980530521","https://openalex.org/W1985123706","https://openalex.org/W1991143034","https://openalex.org/W1995725694","https://openalex.org/W1999032440","https://openalex.org/W2001663593","https://openalex.org/W2002025272","https://openalex.org/W2002864099","https://openalex.org/W2008724760","https://openalex.org/W2009813398","https://openalex.org/W2022749269","https://openalex.org/W2028932986","https://openalex.org/W2034946612","https://openalex.org/W2038225707","https://openalex.org/W2044859592","https://openalex.org/W2045417786","https://openalex.org/W2048564574","https://openalex.org/W2052701473","https://openalex.org/W2055656009","https://openalex.org/W2055711302","https://openalex.org/W2058422149","https://openalex.org/W2063844956","https://openalex.org/W2073029179","https://openalex.org/W2081254453","https://openalex.org/W2086423976","https://openalex.org/W2086653003","https://openalex.org/W2087964954","https://openalex.org/W2091921997","https://openalex.org/W2097098285","https://openalex.org/W2097646889","https://openalex.org/W2106478922","https://openalex.org/W2107052785","https://openalex.org/W2110180651","https://openalex.org/W2110871651","https://openalex.org/W2111385661","https://openalex.org/W2120358419","https://openalex.org/W2143698439","https://openalex.org/W2152490496","https://openalex.org/W2153413398","https://openalex.org/W2162784288","https://openalex.org/W2163925208","https://openalex.org/W2165967486","https://openalex.org/W2169488047","https://openalex.org/W2177980858","https://openalex.org/W2179897858","https://openalex.org/W2185716868","https://openalex.org/W2218607027","https://openalex.org/W2272045681","https://openalex.org/W2405388088","https://openalex.org/W2610183793","https://openalex.org/W2621263703","https://openalex.org/W2963693432","https://openalex.org/W3037538996","https://openalex.org/W3144422206","https://openalex.org/W3150556231"],"related_works":["https://openalex.org/W2514739098","https://openalex.org/W1619463472","https://openalex.org/W2091921997","https://openalex.org/W2133344054","https://openalex.org/W2120358419","https://openalex.org/W2185716868","https://openalex.org/W2095933180","https://openalex.org/W2154297841","https://openalex.org/W2198855630","https://openalex.org/W2285292888","https://openalex.org/W1967935161","https://openalex.org/W1530739071","https://openalex.org/W2049251121","https://openalex.org/W2953223971","https://openalex.org/W2102107640","https://openalex.org/W1549252969","https://openalex.org/W2269732096","https://openalex.org/W3081989770","https://openalex.org/W3185022466","https://openalex.org/W1885256053"],"abstract_inverted_index":{"We":[0],"show":[1],"optimal":[2],"(up":[3],"to":[4,64],"a":[5,10,41,52,84],"constant":[6],"factor)":[7],"NP-hardness":[8,99],"for":[9],"maximum":[11],"constraint":[12,19],"satisfaction":[13],"problem":[14],"with":[15],"k":[16,21,24],"variables":[17],"per":[18],"(Max-":[20],"CSP)":[22],"whenever":[23,73],"is":[25,45,55,62,76,83],"larger":[26],"than":[27],"the":[28,74,98],"domain":[29],"size.":[30],"This":[31],"follows":[32],"from":[33],"our":[34],"main":[35,60,81],"result":[36,61],"concerning":[37],"CSPs":[38],"given":[39],"by":[40,89],"predicate:":[42],"A":[43],"CSP":[44],"approximation":[46],"resistant":[47],"if":[48],"its":[49],"predicate":[50,75],"contains":[51],"subgroup":[53],"that":[54],"balanced":[56],"pairwise":[57],"independent.":[58],"Our":[59,80],"analogous":[63],"Austrin":[65],"and":[66,108],"Mossel\u2019s,":[67],"bypassing":[68],"their":[69],"Unique-Games":[70],"Conjecture":[71],"assumption":[72],"an":[77],"abelian":[78],"subgroup.":[79],"ingredient":[82],"new":[85],"gap-amplification":[86],"technique":[87],"inspired":[88],"XOR":[90],"lemmas.":[91],"Using":[92],"this":[93],"technique,":[94],"we":[95],"also":[96],"improve":[97],"of":[100],"approximating":[101],"Independent-Set":[102],"on":[103],"bounded-degree":[104],"graphs,":[105],"Almost-Coloring,":[106],"Label-Cover,":[107],"various":[109],"other":[110],"problems.":[111]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":7}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}