{"id":"https://openalex.org/W2073029179","doi":"https://doi.org/10.1145/2213977.2214005","title":"A new point of NP-hardness for unique games","display_name":"A new point of NP-hardness for unique games","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2073029179","doi":"https://doi.org/10.1145/2213977.2214005","mag":"2073029179"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214005","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5051167298","display_name":"Ryan O\u2019Donnell","orcid":"https://orcid.org/0009-0005-5609-5795"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ryan O'Donnell","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015430753","display_name":"John C. Wright","orcid":"https://orcid.org/0000-0002-6926-1837"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Wright","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051167298"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":6.2204,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.96875,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"289","last_page":"306"},"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.9997000098228455,"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.9997000098228455,"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.9962000250816345,"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/T10142","display_name":"Formal Methods in Verification","score":0.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.7898573875427246},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5893826484680176},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5730445384979248},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.514570415019989},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.44093868136405945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40159016847610474},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35537785291671753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3200477361679077},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3106696605682373},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08636289834976196},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05136388540267944},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.04873549938201904}],"concepts":[{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7898573875427246},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5893826484680176},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5730445384979248},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.514570415019989},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.44093868136405945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40159016847610474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35537785291671753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3200477361679077},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3106696605682373},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08636289834976196},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05136388540267944},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.04873549938201904},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2213977.2214005","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W183568742","https://openalex.org/W639289183","https://openalex.org/W1501644705","https://openalex.org/W1502009568","https://openalex.org/W1519520700","https://openalex.org/W1528220564","https://openalex.org/W1591762700","https://openalex.org/W1756950477","https://openalex.org/W1846376331","https://openalex.org/W1886138972","https://openalex.org/W1970259241","https://openalex.org/W1973898585","https://openalex.org/W1985123706","https://openalex.org/W1985572324","https://openalex.org/W1990896327","https://openalex.org/W1999032440","https://openalex.org/W2002025272","https://openalex.org/W2007997869","https://openalex.org/W2027020884","https://openalex.org/W2028932986","https://openalex.org/W2047861934","https://openalex.org/W2059222268","https://openalex.org/W2072802070","https://openalex.org/W2078929687","https://openalex.org/W2081192873","https://openalex.org/W2081254453","https://openalex.org/W2081684569","https://openalex.org/W2087038607","https://openalex.org/W2087226760","https://openalex.org/W2090863037","https://openalex.org/W2095315734","https://openalex.org/W2099614783","https://openalex.org/W2117220151","https://openalex.org/W2120358419","https://openalex.org/W2124619161","https://openalex.org/W2130703751","https://openalex.org/W2143698439","https://openalex.org/W2146489710","https://openalex.org/W2153413398","https://openalex.org/W2163925208","https://openalex.org/W2166900508","https://openalex.org/W2221384962","https://openalex.org/W2242403914","https://openalex.org/W2257080673","https://openalex.org/W2742022539","https://openalex.org/W2950029189","https://openalex.org/W3104153247","https://openalex.org/W3141099616","https://openalex.org/W4250871362","https://openalex.org/W6741726336"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2963411648","https://openalex.org/W2952838392","https://openalex.org/W2016001296","https://openalex.org/W1963195391","https://openalex.org/W2019123979","https://openalex.org/W1606488336","https://openalex.org/W3125240838"],"abstract_inverted_index":{"We":[0],"show":[1,77],"that":[2,22,59],"distinguishing":[3],"1/2-satisfiable":[4],"Unique-Games":[5,36],"instances":[6,11],"from":[7],"(3/8":[8],"+":[9],"\u03b5)-satisfiable":[10],"is":[12,21,53,82],"NP-hard":[13],"(for":[14],"all":[15,38],"\u03b5":[16],">":[17],"0).":[18,48],"A":[19],"consequence":[20],"we":[23],"match":[24],"or":[25],"improve":[26],"the":[27,54,64,85],"best":[28],"known":[29],"c":[30,41,44],"vs.":[31],"s":[32],"NP-hardness":[33,71],"result":[34,57],"for":[35,37,43],"values":[39],"of":[40],"(except":[42],"very":[45],"close":[46],"to":[47,62],"For":[49],"these":[50],"c,":[51],"ours":[52],"first":[55],"hardness":[56],"showing":[58],"it":[60],"helps":[61],"take":[63],"alphabet":[65],"size":[66],"larger":[67],"than":[68],"2.":[69],"Our":[70],"reductions":[72],"are":[73],"quasilinear-size":[74],"and":[75],"thus":[76],"nearly":[78],"full":[79],"exponential":[80],"time":[81],"required,":[83],"assuming":[84],"ETH.":[86]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}