{"id":"https://openalex.org/W2027607915","doi":"https://doi.org/10.1109/ccc.2014.16","title":"Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs","display_name":"Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2027607915","doi":"https://doi.org/10.1109/ccc.2014.16","mag":"2027607915"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2014.16","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://arxiv.org/pdf/1312.2915.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011759026","display_name":"Rishi Saket","orcid":"https://orcid.org/0000-0002-0848-6987"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rishi Saket","raw_affiliation_strings":["[IBM India Res. Lab., Bangalore, India]"],"affiliations":[{"raw_affiliation_string":"[IBM India Res. Lab., Bangalore, India]","institution_ids":["https://openalex.org/I1341412227"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011759026"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":null,"apc_paid":null,"fwci":1.159,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":10,"citation_normalized_percentile":{"value":0.75614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":87},"biblio":{"volume":null,"issue":null,"first_page":"78","last_page":"89"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9999,"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.9999,"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.9995,"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/T10237","display_name":"Cryptography and Data Security","score":0.9894,"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/hypergraph","display_name":"Hypergraph","score":0.6528987},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.47301888},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47044438},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.46134573}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7751206},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6528987},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5315832},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47678757},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.47301888},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47044438},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.46134573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45571777},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4445775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41799262},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3961861},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3901974},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22372153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13275701},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2014.16","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":null,"pdf_url":"http://arxiv.org/pdf/1312.2915.pdf","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":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1312.2915","pdf_url":"https://arxiv.org/pdf/1312.2915","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":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":null,"pdf_url":"http://arxiv.org/pdf/1312.2915.pdf","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":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":29,"referenced_works":["https://openalex.org/W1529433769","https://openalex.org/W1898334569","https://openalex.org/W1970259241","https://openalex.org/W1982506822","https://openalex.org/W1990487760","https://openalex.org/W1999032440","https://openalex.org/W2006017609","https://openalex.org/W2019578639","https://openalex.org/W2027607915","https://openalex.org/W2036660814","https://openalex.org/W2040303158","https://openalex.org/W2043963325","https://openalex.org/W2047861934","https://openalex.org/W2069816168","https://openalex.org/W2096478102","https://openalex.org/W2100780780","https://openalex.org/W2137373403","https://openalex.org/W2138792657","https://openalex.org/W2139689595","https://openalex.org/W2148352980","https://openalex.org/W2153413398","https://openalex.org/W2157016223","https://openalex.org/W2163010692","https://openalex.org/W2166278581","https://openalex.org/W2177143319","https://openalex.org/W2949537674","https://openalex.org/W2952139501","https://openalex.org/W3004384893","https://openalex.org/W4248457395"],"related_works":["https://openalex.org/W4307324288","https://openalex.org/W3172736027","https://openalex.org/W2963411648","https://openalex.org/W2963158951","https://openalex.org/W2952838392","https://openalex.org/W2307719096","https://openalex.org/W2131810278","https://openalex.org/W2115404728","https://openalex.org/W2000333212","https://openalex.org/W1561811279"],"abstract_inverted_index":{"This":[0],"work":[1,287],"revisits":[2],"the":[3,8,44,102,149,180,201,214,231,245,253,264,286],"PCP":[4,40,224],"Verifiers":[5,41,225],"used":[6,226,238],"in":[7,30,171,218,227,239,249],"works":[9],"of":[10,78,101,104,111,148,151,156,183,194,233,273,288],"Hastad":[11],"[1],":[12,219],"Guruswami":[13,20,184],"et":[14,185,290],"al.":[15,186,291],"[2],":[16],"Holmerin":[17,189],"[3]":[18,220],"and":[19,25,27,37,188,207,221],"[4]":[21],"for":[22,82,114,159,168,205,263],"satisfiable":[23,106,153],"MAX-E3-SAT":[24,206],"MAX-EkSET-SPLITTING,":[26],"independent":[28,76,169],"set":[29,77,170],"2-colorable":[31,71,172],"4-uniform":[32,72,173],"hypergraphs.":[33],"We":[34],"provide":[35],"simpler":[36],"more":[38],"efficient":[39],"to":[42,244,251],"prove":[43],"following":[45],"improved":[46,246],"hardness":[47,166,247],"results:":[48],"Assuming":[49],"that":[50,95,132],"NP":[51],"\u2288":[52],"DTIME(N":[53],"O(log":[56],"log":[57],"N)":[58],"),":[59],".":[60,88],"There":[61,89],"is":[62,90,127,175,209],"no":[63,91,128],"polynomial":[64,92,129],"time":[65,93,130],"algorithm":[66,94,131],"that,":[67],"given":[68],"an":[69,75,176,210],"n-vertex":[70],"hypergraph,":[73],"finds":[74,133],"n/(log":[79],"n)c":[80,108,146],"vertices,":[81],"some":[83,115,160],"constant":[84,116,161],"c":[85,117,162],">":[86,118,163],"0.":[87,119,164],"satisfies":[96],"7/8":[97],"+":[98,144],"1":[99],"fraction":[100,147],"clauses":[103],"a":[105,134,152,234,270],"MAX-E3(log":[107],"SAT":[109],"instance":[110,155],"size":[112,157],"n,":[113,158],"For":[120],"any":[121],"fixed":[122],"k":[123],"\u2265":[124],"4,":[125],"there":[126],"partition":[135],"splitting":[136],"(1":[137],"-":[138],"2":[139],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-k+1":[142],")":[143],"1/(log":[145],"k-sets":[150],"MAX-Ek-SET-SPLITTING":[154],"Our":[165],"factor":[167],"hypergraphs":[174],"exponential":[177,211],"improvement":[178,212],"over":[179,213,281],"previous":[181,215,240],"results":[182,229],"[2]":[187],"[3].":[190],"Similarly,":[191],"our":[192,228],"inapproximability":[193],"(log":[195],"n)":[196],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-c":[199],"beyond":[200],"random":[202],"assignment":[203],"threshold":[204],"MAX-Ek-SETSPLITTING":[208],"bounds":[216],"proved":[217],"[4].":[222],"The":[223],"avoid":[230],"use":[232,269],"variable":[235],"bias":[236],"parameter":[237],"works,":[241],"which":[242],"leads":[243],"thresholds":[248],"addition":[250],"simplifying":[252],"analysis":[254],"substantially.":[255],"Apart":[256],"from":[257,260,285],"standard":[258],"techniques":[259],"Fourier":[261],"Analysis,":[262],"first":[265],"mentioned":[266],"result":[267],"we":[268],"mixing":[271],"estimate":[272],"Markov":[274],"Chains":[275],"based":[276],"on":[277],"uniform":[278],"reverse":[279],"hypercontractivity":[280],"general":[282],"product":[283],"spaces":[284],"Mossel":[289],"[5],":[292],"[6].":[293]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2027607915","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-01-03T04:52:36.076154","created_date":"2016-06-24"}