{"id":"https://openalex.org/W2885551440","doi":"https://doi.org/10.4086/toc.2018.v014a010","title":"","display_name":"","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2885551440","doi":"https://doi.org/10.4086/toc.2018.v014a010","mag":"2885551440"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2018.v014a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a010","pdf_url":"http://www.theoryofcomputing.org/articles/v014a010/v014a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v014a010/v014a010.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112346695","display_name":"Mrinalkanti Ghosh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mrinalkanti Ghosh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057481716","display_name":"Madhur Tulsiani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Madhur Tulsiani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3803,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.63700486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"33"},"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.9998000264167786,"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.9998000264167786,"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.9995999932289124,"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.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7593135833740234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7320476174354553},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5803831815719604},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5509240031242371},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5201107263565063},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5150096416473389},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5076032876968384},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.48496580123901367},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4731108844280243},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.4683125913143158},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45684728026390076},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.43762868642807007},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42899876832962036},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4166802763938904},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3982871174812317},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.161271870136261},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10721215605735779},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0756719708442688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07184961438179016}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7593135833740234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7320476174354553},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5803831815719604},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5509240031242371},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5201107263565063},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5150096416473389},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5076032876968384},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.48496580123901367},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4731108844280243},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.4683125913143158},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45684728026390076},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.43762868642807007},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42899876832962036},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4166802763938904},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3982871174812317},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.161271870136261},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10721215605735779},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0756719708442688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07184961438179016},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2018.v014a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a010","pdf_url":"http://www.theoryofcomputing.org/articles/v014a010/v014a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2018.v014a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a010","pdf_url":"http://www.theoryofcomputing.org/articles/v014a010/v014a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7052496981","display_name":"CAREER: Understanding Polynomial Structure Analytically and Algorithmically","funder_award_id":"1254044","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2885551440.pdf","grobid_xml":"https://content.openalex.org/works/W2885551440.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W436674831","https://openalex.org/W1587123489","https://openalex.org/W1755753347","https://openalex.org/W1952648253","https://openalex.org/W1967821609","https://openalex.org/W2002025272","https://openalex.org/W2004067661","https://openalex.org/W2007239493","https://openalex.org/W2028085501","https://openalex.org/W2038907843","https://openalex.org/W2049143039","https://openalex.org/W2049251121","https://openalex.org/W2064035344","https://openalex.org/W2083858754","https://openalex.org/W2106264302","https://openalex.org/W2107052785","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2146823188","https://openalex.org/W2151395725","https://openalex.org/W2166536886","https://openalex.org/W2169488047","https://openalex.org/W2185716868","https://openalex.org/W2405977959","https://openalex.org/W2411816729","https://openalex.org/W2523377094","https://openalex.org/W2529974411","https://openalex.org/W2574497079","https://openalex.org/W2621263703","https://openalex.org/W2950298732","https://openalex.org/W2952768013","https://openalex.org/W2963010019","https://openalex.org/W3098011928","https://openalex.org/W3125756447","https://openalex.org/W4226347946","https://openalex.org/W6966348173"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2887154986","https://openalex.org/W1968512104","https://openalex.org/W78560857"],"abstract_inverted_index":{"$":[0,2],"\\newcommand{\\littleoh}{\\operatorname{o}}":[1],"We":[3,17,225],"study":[4],"the":[5,23,37,52,98,108,112,118,121,124,146,155,159,185,213,231,247,250],"approximability":[6],"of":[7,51,63,105,107,114,120,153,158,170,212,242,249],"constraint":[8],"satisfaction":[9],"problems":[10],"(CSPs)":[11],"by":[12,26,43,69,78,101,172,187],"linear":[13],"programming":[14],"(LP)":[15],"relaxations.":[16],"show":[18],"that":[19,84,134],"for":[20,85,168,197],"every":[21],"CSP,":[22],"approximation":[24,38,169,195,219],"obtained":[25,39,100],"a":[27,102,165,201,222],"basic":[28,147],"LP":[29,89,137,174],"relaxation":[30,99],"is":[31,92,140],"at":[32,93,141],"least":[33],"as":[34,36,95,97,143,145,154],"strong":[35,96,144],"using":[40],"relaxations":[41],"given":[42],"$c":[44,58],"\\cdot":[45],"\\log":[46,48,209,236],"n/\\log":[47,235],"n$":[49],"levels":[50,106,115,211],"Sherali--Adams":[53,109,160,214],"hierarchy":[54,110,215],"(for":[55],"some":[56],"constant":[57,103],">":[59],"0$)":[60],"on":[61,117,193],"instances":[62],"size":[64,125],"$n.$":[65],"It":[66],"was":[67],"proved":[68],"Chan":[70],"et":[71,80,189],"al.":[72,81,190],"[FOCS":[73],"2013]":[74],"(and":[75],"recently":[76],"strengthened":[77],"Kothari":[79],"[STOC":[82,191],"2017])":[83],"CSPs,":[86],"any":[87,135],"polynomial-size":[88,136,173],"extended":[90,138,175],"formulation":[91,139],"most":[94,142],"number":[104,113],"(where":[111],"depend":[116],"exponent":[119],"polynomial":[122],"in":[123,246],"bound).":[126],"Combining":[127],"this":[128,243],"with":[129],"our":[130,178],"result":[131,167,186],"also":[132,181],"implies":[133],"LP,":[148],"which":[149,207],"can":[150],"be":[151],"thought":[152],"base":[156],"level":[157],"hierarchy.":[161],"This":[162],"essentially":[163],"gives":[164],"dichotomy":[166],"CSPs":[171],"formulations.":[176],"Using":[177],"techniques,":[179],"we":[180],"simplify":[182,226],"and":[183,203,229],"strengthen":[184,230],"Khot":[188],"2014]":[192],"(strong)":[194],"resistance":[196],"LPs.":[198],"They":[199],"provided":[200],"necessary":[202],"sufficient":[204],"condition":[205],"under":[206],"$\\littleoh(\\log":[208],"n)$":[210],"cannot":[216],"achieve":[217],"an":[218],"better":[220],"than":[221],"random":[223],"assignment.":[224],"their":[227],"proof":[228],"bound":[232],"to":[233],"$\\littleoh\\left(\\log":[234],"n\\right)$":[237],"levels.":[238],"A":[239],"conference":[240],"version":[241],"paper":[244],"appeared":[245],"Proceedings":[248],"32nd":[251],"Computational":[252],"Complexity":[253],"Conference":[254],"(CCC'17).":[255]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2018-08-22T00:00:00"}