{"id":"https://openalex.org/W2242403914","doi":"https://doi.org/10.1145/2775105","title":"Subexponential Algorithms for Unique Games and Related Problems","display_name":"Subexponential Algorithms for Unique Games and Related Problems","publication_year":2015,"publication_date":"2015-11-02","ids":{"openalex":"https://openalex.org/W2242403914","doi":"https://doi.org/10.1145/2775105","mag":"2242403914"},"language":"en","primary_location":{"id":"doi:10.1145/2775105","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2775105","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/A5103334936","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0002-8636-9970"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjeev Arora","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102710346","display_name":"Boaz Barak","orcid":"https://orcid.org/0000-0002-4053-8927"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]},{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Boaz Barak","raw_affiliation_strings":["Microsoft Research New England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research New England","institution_ids":["https://openalex.org/I4210164937","https://openalex.org/I4400600948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089128021","display_name":"David Steurer","orcid":"https://orcid.org/0000-0002-3908-8180"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Steurer","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103334936"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":7.9946,"has_fulltext":false,"cited_by_count":89,"citation_normalized_percentile":{"value":0.9799309,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"62","issue":"5","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9994000196456909,"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/combinatorics","display_name":"Combinatorics","score":0.6990044713020325},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5848443508148193},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5589534044265747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5430455207824707},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5423073172569275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5391642451286316},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5269109606742859},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44475364685058594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40990114212036133}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6990044713020325},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5848443508148193},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5589534044265747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5430455207824707},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5423073172569275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5391642451286316},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5269109606742859},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44475364685058594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40990114212036133},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/2775105","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2775105","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W100944330","https://openalex.org/W176777629","https://openalex.org/W186443161","https://openalex.org/W1502009568","https://openalex.org/W1571037334","https://openalex.org/W1631603072","https://openalex.org/W1886138972","https://openalex.org/W1965562201","https://openalex.org/W1974672137","https://openalex.org/W1975452925","https://openalex.org/W1993111701","https://openalex.org/W1995725694","https://openalex.org/W1996447604","https://openalex.org/W1998544343","https://openalex.org/W1999032440","https://openalex.org/W2007385254","https://openalex.org/W2010004564","https://openalex.org/W2010350688","https://openalex.org/W2014323766","https://openalex.org/W2019374631","https://openalex.org/W2019404063","https://openalex.org/W2026753685","https://openalex.org/W2032336879","https://openalex.org/W2034534236","https://openalex.org/W2038098381","https://openalex.org/W2038225707","https://openalex.org/W2039592987","https://openalex.org/W2042654457","https://openalex.org/W2050961553","https://openalex.org/W2070208264","https://openalex.org/W2072858942","https://openalex.org/W2078929687","https://openalex.org/W2084204509","https://openalex.org/W2087038607","https://openalex.org/W2095315734","https://openalex.org/W2095727035","https://openalex.org/W2098350988","https://openalex.org/W2103649698","https://openalex.org/W2110871651","https://openalex.org/W2114448228","https://openalex.org/W2116537669","https://openalex.org/W2117220151","https://openalex.org/W2119378898","https://openalex.org/W2120358419","https://openalex.org/W2127248062","https://openalex.org/W2137118456","https://openalex.org/W2149577432","https://openalex.org/W2151239055","https://openalex.org/W2151395725","https://openalex.org/W2152394048","https://openalex.org/W2153413398","https://openalex.org/W2155618818","https://openalex.org/W2161719898","https://openalex.org/W2162746978","https://openalex.org/W2165732281","https://openalex.org/W2166536886","https://openalex.org/W2179025976","https://openalex.org/W2277469547","https://openalex.org/W2295961103","https://openalex.org/W3098071389","https://openalex.org/W3141099616"],"related_works":["https://openalex.org/W2074481494","https://openalex.org/W3194471551","https://openalex.org/W4250156143","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2784911598","https://openalex.org/W4247156967","https://openalex.org/W4297950433","https://openalex.org/W1973978937","https://openalex.org/W1982437410"],"abstract_inverted_index":{"Subexponential":[0],"time":[1],"approximation":[2,128,182,249],"algorithms":[3,30,256,338],"are":[4,31,153,211,238],"presented":[5,125],"for":[6,21,187,273,339],"the":[7,27,70,194,201,304,309],"U":[8,188,207,340],"nique":[9,189,208,341],"G":[10,190,209,283,292,298,342],"ames":[11,191,210,343],"and":[12,140,235,277,351],"S":[13,92,135],"mall":[14],"-S":[15],"et":[16],"E":[17],"xpansion":[18],"problems.":[19],"Specifically,":[20],"some":[22,146],"absolute":[23],"constant":[24],"c":[25,58,103],",":[26,104,134,139,159,224,229,234,284],"following":[28],"two":[29],"presented.":[32],"(1)":[33],"An":[34,73],"exp(":[35,74],"kn":[36],"\u03f5":[37,76,102,275,319],")-time":[38],"algorithm":[39,78,122,245,332],"that,":[40,79],"given":[41,80],"as":[42,81,185,219],"input":[43,82],"a":[44,90,106,243,247,258],"k":[45],"-alphabet":[46],"unique":[47],"game":[48],"on":[49,145,312,328,344],"n":[50,75,84,95,113,280,318],"variables":[51],"that":[52,88,175,206,264,303],"has":[53,89,315],"an":[54,64,83,160],"assignment":[55,65],"satisfying":[56,66],"1-\u03f5":[57,67],"fraction":[59,68,290],"of":[60,69,93,109,149,199,261,291,308],"its":[61],"constraints,":[62],"outputs":[63,105],"constraints.":[71],"(2)":[72],"/\u03b4)-time":[77],"-vertex":[85,281],"regular":[86,279],"graph":[87,163,262,282,311],"set":[91,107],"\u03b4":[94,112,289],"vertices":[96,114],"with":[97,115,126,155,336,346],"edge":[98,116],"expansion":[99,117],"at":[100,110,118,223,287,316],"most":[101,111,119,288,317],"S'":[108],"\u03f5.":[120,329],"subexponential":[121,244,331],"is":[123,177,257,271],"also":[124],"improved":[127],"to":[129,180,241],"M":[130,220,225],"ax":[131,221,226],"C":[132,137,143,232],"ut":[133,138],"parsest":[136],"V":[141],"ertex":[142],"over":[144,233],"interesting":[147,161],"subclasses":[148],"instances.":[150],"These":[151],"instances":[152],"graphs":[154,345],"low":[156],"threshold":[157],"rank":[158],"new":[162,259],"parameter":[164],"highlighted":[165],"by":[166,285],"this":[167,334],"work.":[168],"Khot's":[169],"Unique":[170],"Games":[171],"Conjecture":[172],"(UGC)":[173],"states":[174],"it":[176,270],"NP":[178,215],"-hard":[179,216],"achieve":[181],"guarantees":[183],"such":[184,218],"ours":[186],".":[192],"While":[193],"results":[195],"here":[196],"stop":[197],"short":[198],"refuting":[200],"UGC,":[202],"they":[203],"do":[204],"suggest":[205],"significantly":[212],"easier":[213],"than":[214,322],"problems":[217],"3-S":[222],"3-":[227],"Lin":[228],"L":[230],"abel":[231],"more,":[236],"which":[237],"believed":[239],"not":[240],"have":[242,266],"achieving":[246],"nontrivial":[248],"ratio.":[250],"Of":[251],"special":[252],"interest":[253],"in":[254],"these":[255],"notion":[260],"decomposition":[263,335],"may":[265],"other":[267],"applications.":[268],"Namely,":[269],"shown":[272],"every":[274,278],">0":[276],"changing":[286],"'s":[293],"edges,":[294],"one":[295],"can":[296],"break":[297],"into":[299],"disjoint":[300],"parts":[301],"so":[302],"stochastic":[305],"adjacency":[306],"matrix":[307],"induced":[310],"each":[313],"part":[314],"eigenvalues":[320,349],"larger":[321],"1-\u03b7,":[323],"where":[324],"\u03b7":[325],"depends":[326],"polynomially":[327],"The":[330],"combines":[333],"previous":[337],"few":[347],"large":[348],"[Kolla":[350],"Tulsiani":[352],"2007;":[353],"Kolla":[354],"2010].":[355]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":9}],"updated_date":"2026-05-25T08:39:21.599409","created_date":"2025-10-10T00:00:00"}