{"id":"https://openalex.org/W2047861934","doi":"https://doi.org/10.1137/07068062x","title":"Conditional Hardness for Approximate Coloring","display_name":"Conditional Hardness for Approximate Coloring","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2047861934","doi":"https://doi.org/10.1137/07068062x","mag":"2047861934"},"language":"en","primary_location":{"id":"doi:10.1137/07068062x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07068062x","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":"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/A5029616850","display_name":"Irit Dinur","orcid":"https://orcid.org/0000-0002-4335-5237"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Irit Dinur","raw_affiliation_strings":["irit.dinur@weizmann.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"irit.dinur@weizmann.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013467728","display_name":"Elchanan Mossel","orcid":"https://orcid.org/0000-0001-7812-7886"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Elchanan Mossel","raw_affiliation_strings":["mossel@stat.berkeley.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"mossel@stat.berkeley.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108189093","display_name":"Oded Regev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oded Regev","raw_affiliation_strings":["odedr@post.tau.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"odedr@post.tau.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.6925,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.9781491,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"39","issue":"3","first_page":"843","last_page":"873"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6517322063446045},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6499289274215698},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6432619094848633},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5831224322319031},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5712266564369202},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5136082172393799},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4778192341327667},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4422800838947296},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40320444107055664},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.25080597400665283},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15756258368492126},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09731042385101318}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6517322063446045},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6499289274215698},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6432619094848633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5831224322319031},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5712266564369202},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5136082172393799},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4778192341327667},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4422800838947296},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40320444107055664},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25080597400665283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15756258368492126},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09731042385101318},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/07068062x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07068062x","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W340925356","https://openalex.org/W1529433769","https://openalex.org/W1529556207","https://openalex.org/W1542602023","https://openalex.org/W1559492868","https://openalex.org/W1824882367","https://openalex.org/W1969999211","https://openalex.org/W1982506822","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2005090831","https://openalex.org/W2019578639","https://openalex.org/W2036660814","https://openalex.org/W2042179958","https://openalex.org/W2058422149","https://openalex.org/W2068823397","https://openalex.org/W2069816168","https://openalex.org/W2074734756","https://openalex.org/W2074891431","https://openalex.org/W2078929687","https://openalex.org/W2080479164","https://openalex.org/W2087038607","https://openalex.org/W2095727035","https://openalex.org/W2101644337","https://openalex.org/W2104254886","https://openalex.org/W2107527022","https://openalex.org/W2111385661","https://openalex.org/W2118599421","https://openalex.org/W2120358419","https://openalex.org/W2125710943","https://openalex.org/W2132991500","https://openalex.org/W2137118456","https://openalex.org/W2143698439","https://openalex.org/W2148352980","https://openalex.org/W2949874440"],"related_works":["https://openalex.org/W623607250","https://openalex.org/W4245429118","https://openalex.org/W4245505501","https://openalex.org/W2921334381","https://openalex.org/W4255529442","https://openalex.org/W4212927854","https://openalex.org/W1545246811","https://openalex.org/W4236448199","https://openalex.org/W3194471551","https://openalex.org/W4383877548"],"abstract_inverted_index":{"We":[0,16],"study":[1],"the":[2,49,87,101],"AprxColoring$(q,Q)$":[3],"problem:":[4],"Given":[5],"a":[6,69],"graph":[7],"G,":[8],"decide":[9],"whether":[10],"$\\chi(G)\\le":[11],"q$":[12],"or":[13],"$\\chi(G)\\ge":[14],"Q$.":[15],"present":[17],"hardness":[18,66,78],"results":[19],"for":[20,23,82],"this":[21],"problem":[22],"any":[24],"constants":[25],"$3\\le":[26],"q<Q$.":[27],"For":[28,61],"$q\\ge4$,":[29],"our":[30,65,90],"result":[31,67,79],"is":[32,40],"based":[33],"on":[34,54,68,95],"Khot's":[35],"2-to-1":[36],"label":[37],"cover,":[38],"which":[39,99],"conjectured":[41],"to":[42,123],"be":[43],"NP-hard":[44],"[S.":[45],"Khot,":[46],"Proceedings":[47],"of":[48,56,73,89,104,111,120],"34th":[50],"Annual":[51],"ACM":[52],"Symposium":[53],"Theory":[55],"Computing,":[57],"2002,":[58],"pp.":[59],"767\u2013775].":[60],"$q=3$,":[62],"we":[63],"base":[64],"certain":[70],"\u201c${\\rhd\\hskip-0.5em<}$-shaped\u201d":[71],"variant":[72],"his":[74],"conjecture.":[75],"Previously":[76],"no":[77],"was":[80],"known":[81],"$q=3$":[83],"and":[84,107,117,125],"$Q\\ge6$.":[85],"At":[86],"heart":[88],"proof":[91],"are":[92],"tight":[93],"bounds":[94],"generalized":[96],"noise-stability":[97],"quantities,":[98],"extend":[100],"recent":[102],"work":[103],"Mossel,":[105],"O'Donnell,":[106],"Oleszkiewicz":[108],"[\u201cNoise":[109],"stability":[110],"functions":[112],"with":[113],"low":[114],"influences:":[115],"Invariance":[116],"optimality,\u201d":[118],"Ann.":[119],"Math.":[121],"(2),":[122],"appear]":[124],"should":[126],"have":[127],"wider":[128],"applicability.":[129]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":17},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":8}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}