{"id":"https://openalex.org/W2154297841","doi":null,"title":"Conditional Inapproximability and Limited Independence","display_name":"Conditional Inapproximability and Limited Independence","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2154297841","mag":"2154297841"},"language":"en","primary_location":{"id":"pmh:oai:DiVA.org:kth-9420","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-9422","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I86987016","host_organization_name":"KTH Royal Institute of Technology","host_organization_lineage":["https://openalex.org/I86987016"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-9422","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055776088","display_name":"Per Austrin","orcid":"https://orcid.org/0000-0001-8217-0158","observed_orcids":["https://orcid.org/0000-0001-8217-0158"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Per Austrin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5055776088"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8939999938011169,"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.8939999938011169,"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.06830000132322311,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.024399999529123306,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/max-csp","display_name":"Max-CSP","score":0.871999979019165},{"id":"https://openalex.org/keywords/unique-games-conjecture","display_name":"Unique Games Conjecture","score":0.8080000281333923},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.6840000152587891},{"id":"https://openalex.org/keywords/max-2-sat","display_name":"MAX-2-SAT","score":0.9819999933242798},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.8159999847412109},{"id":"https://openalex.org/keywords/geometric-conjectures","display_name":"geometric conjectures","score":0.40400001406669617},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"triangle inequality","score":0.3610000014305115}],"concepts":[{"id":"https://openalex.org/C114928208","wikidata":"https://www.wikidata.org/wiki/Q17104952","display_name":"Pairwise independence","level":5,"score":0.8056241273880005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7172883152961731},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.710202157497406},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5951647162437439},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5799448490142822},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5238456726074219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5030583739280701},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47479623556137085},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.46218761801719666},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.4504276216030121},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44275015592575073},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41243216395378113},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16215887665748596},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.1396358609199524},{"id":"https://openalex.org/C182514268","wikidata":"https://www.wikidata.org/wiki/Q7636889","display_name":"Sum of normally distributed random variables","level":4,"score":0.11534613370895386},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:DiVA.org:kth-9420","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-9422","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I86987016","host_organization_name":"KTH Royal Institute of Technology","host_organization_lineage":["https://openalex.org/I86987016"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"mag:2154297841","doi":null,"is_oa":false,"landing_page_url":"https://www.csc.kth.se/~austrin/papers/thesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:DiVA.org:kth-9420","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-9422","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I86987016","host_organization_name":"KTH Royal Institute of Technology","host_organization_lineage":["https://openalex.org/I86987016"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":101,"referenced_works":["https://openalex.org/W56772274","https://openalex.org/W105587991","https://openalex.org/W235419749","https://openalex.org/W288944068","https://openalex.org/W332343848","https://openalex.org/W761890699","https://openalex.org/W1480757052","https://openalex.org/W1483560004","https://openalex.org/W1490233153","https://openalex.org/W1491901203","https://openalex.org/W1502009568","https://openalex.org/W1505739153","https://openalex.org/W1507028355","https://openalex.org/W1529433769","https://openalex.org/W1554682571","https://openalex.org/W1564025554","https://openalex.org/W1567190796","https://openalex.org/W1571037334","https://openalex.org/W1576805635","https://openalex.org/W1577891761","https://openalex.org/W1593162480","https://openalex.org/W1600412016","https://openalex.org/W1601503375","https://openalex.org/W1607580485","https://openalex.org/W1846376331","https://openalex.org/W1934904397","https://openalex.org/W1963753244","https://openalex.org/W1964089073","https://openalex.org/W1967935161","https://openalex.org/W1970016373","https://openalex.org/W1970259241","https://openalex.org/W1975810219","https://openalex.org/W1982311066","https://openalex.org/W1985123706","https://openalex.org/W1990896327","https://openalex.org/W1992068214","https://openalex.org/W1992866589","https://openalex.org/W1997855358","https://openalex.org/W2004804919","https://openalex.org/W2007783351","https://openalex.org/W2019578639","https://openalex.org/W2032821770","https://openalex.org/W2034666228","https://openalex.org/W2035693183","https://openalex.org/W2043963325","https://openalex.org/W2049143039","https://openalex.org/W2053913299","https://openalex.org/W2055758906","https://openalex.org/W2059222268","https://openalex.org/W2069816168","https://openalex.org/W2070383478","https://openalex.org/W2073903404","https://openalex.org/W2074465184","https://openalex.org/W2074891431","https://openalex.org/W2078278523","https://openalex.org/W2078345182","https://openalex.org/W2081256580","https://openalex.org/W2081684569","https://openalex.org/W2087038607","https://openalex.org/W2091921997","https://openalex.org/W2094054391","https://openalex.org/W2094654291","https://openalex.org/W2095727035","https://openalex.org/W2095933180","https://openalex.org/W2097673562","https://openalex.org/W2103749128","https://openalex.org/W2106478922","https://openalex.org/W2107052785","https://openalex.org/W2108684595","https://openalex.org/W2108900323","https://openalex.org/W2109039359","https://openalex.org/W2110871651","https://openalex.org/W2111385661","https://openalex.org/W2111478028","https://openalex.org/W2115180773","https://openalex.org/W2117226423","https://openalex.org/W2118599421","https://openalex.org/W2119378898","https://openalex.org/W2120358419","https://openalex.org/W2127141092","https://openalex.org/W2131433282","https://openalex.org/W2137118456","https://openalex.org/W2137717103","https://openalex.org/W2143738202","https://openalex.org/W2146489710","https://openalex.org/W2148352980","https://openalex.org/W2149577432","https://openalex.org/W2154386769","https://openalex.org/W2155618818","https://openalex.org/W2161737792","https://openalex.org/W2167681887","https://openalex.org/W2248038145","https://openalex.org/W2313497592","https://openalex.org/W2327680971","https://openalex.org/W2334237942","https://openalex.org/W2335400162","https://openalex.org/W2342433841","https://openalex.org/W2566335580","https://openalex.org/W2729859113","https://openalex.org/W3004537778","https://openalex.org/W4413186465"],"related_works":["https://openalex.org/W2179897858","https://openalex.org/W7098601044","https://openalex.org/W7019405778","https://openalex.org/W1577891761","https://openalex.org/W346787442","https://openalex.org/W7101195871","https://openalex.org/W2238018701","https://openalex.org/W7100254695","https://openalex.org/W2953223971","https://openalex.org/W2006271461"],"abstract_inverted_index":{"Understanding":[0],"the":[1,10,21,62,67,91,112,118,154,210,230,248,257,282,286,313,331,334,346,351],"theoretical":[2],"limitations":[3],"of":[4,9,15,23,45,66,156,160,212,260,273,285,301,305,316,448,478,485],"efficient":[5],"computation":[6],"is":[7,79,87,100,104,122,140,151,281,329,344,480],"one":[8],"most":[11],"fundamental":[12,182,358],"open":[13],"problems":[14,37,180,184],"modern":[16],"mathematics.":[17],"This":[18,476],"thesis":[19],"studies":[20],"approximability":[22],"intractable":[24,88],"optimization":[25],"problems.":[26,34,242],"In":[27,221],"particular,":[28],"we":[29,40,195,269,297,365,398,419,443,462],"study":[30,164,367],"so-called":[31],"Max":[32,187,190,261,264,267,295,337,342],"CSP":[33,93,179],"These":[35],"are":[36,41,55,216,244,425],"in":[38,360,363,385,406,427,483],"which":[39,99,150],"given":[42],"a":[43,97,107,125,129,144,200,206,271,299,389,410,434,457,464],"set":[44,155],"constraints,":[46],"each":[47],"constraint":[48],"acting":[49],"on":[50,153,173],"some":[51],"k":[52],"variables,":[53],"and":[54,189,199,263,292,325,356,417,488],"asked":[56],"to":[57,61,81,89,95,111,136,218,237,246,252,289,429,432],"find":[58],"an":[59,197],"assignment":[60,110],"variables":[63],"satisfyingas":[64],"many":[65],"constraints":[68,228],"as":[69,186],"possible.":[70],"A":[71],"predicate":[72,130],"P":[73,131,166],":":[74,167],"[q]\u1d4f":[75,149],"\u2192":[76,133,170],"{0,":[77,134,168,171],"1}":[78,135,172],"said":[80],"be":[82,137,430],"approximation":[83,138,283],"resistant":[84,139],"if":[85,117],"it":[86],"approximate":[90],"corresponding":[92,178],"problem":[94],"within":[96],"factor":[98],"better":[101],"than":[102],"what":[103],"expected":[105],"from":[106],"completely":[108],"random":[109,372,383,404,423],"variables.":[113,176],"We":[114,162,374],"prove":[115,375,463],"that":[116,141,312,341,400,421,445],"Unique":[119,201],"Games":[120],"Conjecture":[121],"true,":[123],"then":[124,366],"sufficient":[126],"condition":[127],"for":[128,256,336,353,469],":[q]\u1d4f":[132],"there":[142],"exists":[143],"pairwise":[145,390],"independent":[146,369,391,412,436,459],"distribution":[147,438],"over":[148],"supported":[152],"satisfying":[157],"assignments":[158],"P\u02c9\u00b9(1)":[159],"P.":[161],"also":[163,339],"predicates":[165],"1}\u00b2":[169],"two":[174,214],"boolean":[175],"The":[177],"include":[181],"computational":[183],"such":[185],"Cut":[188,343],"2-Sat.":[191],"For":[192,266,294,303,414],"any":[193],"P,":[194],"give":[196],"algorithm":[198,287],"Games-based":[202],"hardness":[203,250,255,272,300,484],"result.":[204],"Under":[205],"certain":[207,465],"geometric":[208],"conjecture,":[209],"ratios":[211],"these":[213,241,306],"results":[215,309],"shown":[217],"match":[219],"exactly.":[220],"addition,":[222],"this":[223],"result":[224,251,335,352,479],"explains":[225],"why":[226],"additional":[227],"beyond":[229],"standard":[231],"\u201ctriangle":[232],"inequalities\u201d":[233],"do":[234],"not":[235,330,345],"appear":[236],"help":[238],"when":[239],"solving":[240],"Furthermore,we":[243],"able":[245,431],"use":[247],"generic":[249],"obtain":[253,270,298],"improved":[254],"special":[258,314],"cases":[259],"2-Sat":[262],"2-And.":[265],"2-Sat,":[268],"\u03b1LLZ":[274,280],"+":[275],"\u03b5":[276],"\u2248":[277],"0.94016,":[278],"where":[279,320],"ratio":[284],"due":[288],"Lewin,":[290],"Livnat":[291],"Zwick.":[293],"2-And,":[296],"0.87435.":[302],"both":[304],"problems,":[307,355],"our":[308],"surprisingly":[310],"demonstrate":[311],"case":[315],"balanced":[317,437],"instances":[318],"(instances":[319],"every":[321,446],"variable":[322],"occurs":[323],"positively":[324],"negatively":[326],"equally":[327],"often)":[328],"hardest.":[332],"Furthermore,":[333],"2-And":[338],"shows":[340],"hardest":[347],"2-CSP.":[348],"Motivated":[349],"by":[350],"k-CSP":[354],"their":[357],"importance":[359],"computer":[361],"science":[362],"general,":[364],"t-wise":[368,411,435,458],"distributions":[370],"with":[371,377,395,439,450,472],"support.":[373],"that,":[376],"high":[378,396],"probability,":[379,397],"poly(q)":[380],"\u30fb":[381],"n\u00b2":[382],"points":[384,405,424],"[q]\u207f":[386,407,449],"can":[387,408,455],"support":[388,409,433,456],"distribution.":[392,413,460],"Then,":[393],"again":[394],"show":[399,420,444],"(poly(q)":[401],"\u30fbn)\u1d57":[402],"log(n\u1d57)":[403],"constant":[415],"t":[416],"q,":[418],"\u03a9(n\u1d57)":[422],"necessary":[426],"order":[428],"non-negligible":[440],"probability.":[441],"Also,":[442],"subset":[447],"size":[451],"at":[452],"least":[453],"q\u207f(1\u2212poly(q)\u02c9\u1d57)":[454],"Finally,":[461],"noise":[466],"correlation":[467],"bound":[468],"low-degree":[470],"functions":[471],"small":[473],"Fourier":[474],"coefficients.":[475],"type":[477],"generally":[481],"useful":[482],"approximation,":[486],"derandomization,":[487],"additive":[489],"combinatorics.":[490]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}