{"id":"https://openalex.org/W2951692244","doi":"https://doi.org/10.1137/17m1152966","title":"Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs","display_name":"Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs","publication_year":2021,"publication_date":"2021-05-20","ids":{"openalex":"https://openalex.org/W2951692244","doi":"https://doi.org/10.1137/17m1152966","mag":"2951692244"},"language":"en","primary_location":{"id":"doi:10.1137/17m1152966","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1152966","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1610.02704","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068103506","display_name":"Pravesh K. Kothari","orcid":"https://orcid.org/0000-0002-8689-6770"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pravesh K. Kothari","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044675813","display_name":"Raghu Meka","orcid":"https://orcid.org/0009-0004-7676-2762"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raghu Meka","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101701586","display_name":"Prasad Raghavendra","orcid":"https://orcid.org/0009-0009-7851-0653"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prasad Raghavendra","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068103506"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00838728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"51","issue":"2","first_page":"STOC17","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"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/corollary","display_name":"Corollary","score":0.6955881118774414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6596978902816772},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6324481964111328},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6188092231750488},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.616284966468811},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5679911375045776},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5096242427825928},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4630378186702728},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.43000054359436035},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4263988137245178},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2148762345314026},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14055684208869934}],"concepts":[{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6955881118774414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6596978902816772},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6324481964111328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6188092231750488},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.616284966468811},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5679911375045776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5096242427825928},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4630378186702728},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.43000054359436035},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4263988137245178},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2148762345314026},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14055684208869934},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/17m1152966","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1152966","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1610.02704","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1610.02704","pdf_url":"https://arxiv.org/pdf/1610.02704","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2951692244","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1610.02704.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1610.02704","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1610.02704","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1610.02704","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1610.02704","pdf_url":"https://arxiv.org/pdf/1610.02704","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2362145897","display_name":"CAREER: Approximating NP-Hard Problems -Efficient Algorithms and their Limits","funder_award_id":"1343104","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2559653083","display_name":"AF: Medium: Collaborative Research: On the Power of Mathematical Programming in Combinatorial Optimization","funder_award_id":"1408643","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4947009522","display_name":"CAREER: The power and limitations of randomness","funder_award_id":"1553605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6563909748","display_name":null,"funder_award_id":"CCF-1343104","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7697158160","display_name":null,"funder_award_id":"CCF-1553605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G960511165","display_name":null,"funder_award_id":"CCF-1408643","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"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2951692244.pdf","grobid_xml":"https://content.openalex.org/works/W2951692244.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W87237596","https://openalex.org/W1755753347","https://openalex.org/W2012805418","https://openalex.org/W2015127564","https://openalex.org/W2031923588","https://openalex.org/W2038907843","https://openalex.org/W2040889609","https://openalex.org/W2049143039","https://openalex.org/W2077740213","https://openalex.org/W2083858754","https://openalex.org/W2106264302","https://openalex.org/W2107052785","https://openalex.org/W2150285483","https://openalex.org/W2151303208","https://openalex.org/W2185716868","https://openalex.org/W2320692600","https://openalex.org/W3022335368"],"related_works":["https://openalex.org/W2985510938","https://openalex.org/W2963901621","https://openalex.org/W2007385254","https://openalex.org/W2511322911","https://openalex.org/W1973046087","https://openalex.org/W2574497079","https://openalex.org/W1549252969","https://openalex.org/W1983992721","https://openalex.org/W2007239493","https://openalex.org/W3173219382","https://openalex.org/W2989841544","https://openalex.org/W2506301897","https://openalex.org/W2402254081","https://openalex.org/W2606812758","https://openalex.org/W2465024128","https://openalex.org/W3012547898","https://openalex.org/W2185716868","https://openalex.org/W1981949200","https://openalex.org/W1570128105","https://openalex.org/W2074729689"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,37,62,114],"for":[3,33,41,73,92],"constraint":[4],"satisfaction":[5],"problems":[6],"(CSPs),":[7],"sub-exponential":[8,29],"size":[9,30,66],"linear":[10,21,34,63],"programming":[11,22,35],"relaxations":[12,36],"are":[13,80],"as":[14,16,45],"powerful":[15],"$n^{\u03a9(1)}$-rounds":[17],"of":[18,65,116],"the":[19,86],"Sherali-Adams":[20],"hierarchy.":[23],"As":[24],"a":[25,51,107],"corollary,":[26],"we":[27],"obtain":[28],"lower":[31,95],"bounds":[32,79,96],"beat":[38,70],"random":[39,71],"guessing":[40,72],"many":[42],"CSPs":[43],"such":[44],"MAX-CUT":[46],"and":[47,84],"MAX-3SAT.":[48],"This":[49],"is":[50,106],"nearly-exponential":[52],"improvement":[53],"over":[54],"previous":[55],"results,":[56],"previously,":[57],"it":[58],"was":[59],"only":[60],"known":[61],"programs":[64],"$n^{o(\\log":[67],"n)}$":[68],"cannot":[69],"any":[74],"CSP":[75],"(Chan-Lee-Raghavendra-Steurer":[76],"2013).":[77],"Our":[78],"obtained":[81],"by":[82],"exploiting":[83],"extending":[85],"recent":[87],"progress":[88],"in":[89,103,119],"communication":[90,98,120],"complexity":[91],"\"lifting\"":[93],"query":[94],"to":[97],"problems.":[99],"The":[100],"main":[101],"ingredient":[102],"our":[104],"results":[105],"new":[108],"structural":[109],"result":[110],"on":[111],"\"high-entropy":[112],"rectangles\"":[113],"may":[115],"independent":[117],"interest":[118],"complexity.":[121]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}