{"id":"https://openalex.org/W2008724760","doi":"https://doi.org/10.1145/1536414.1536482","title":"Conditional hardness for satisfiable 3-CSPs","display_name":"Conditional hardness for satisfiable 3-CSPs","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W2008724760","doi":"https://doi.org/10.1145/1536414.1536482","mag":"2008724760"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536482","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536482","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5051167298","display_name":"Ryan O\u2019Donnell","orcid":"https://orcid.org/0009-0005-5609-5795"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan O'Donnell","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073986426","display_name":"Yi Wu","orcid":"https://orcid.org/0009-0006-3120-3769"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi Wu","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":4.5163,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95267786,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"493","last_page":"502"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9926999807357788,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6775479912757874},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6728014945983887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6634331941604614},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6216436624526978},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5893533229827881},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5196622610092163},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5012662410736084},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.45772868394851685},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4550533890724182},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41130921244621277},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.408115953207016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15736496448516846},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07281279563903809}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6775479912757874},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6728014945983887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6634331941604614},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6216436624526978},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5893533229827881},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5196622610092163},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5012662410736084},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45772868394851685},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4550533890724182},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41130921244621277},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.408115953207016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15736496448516846},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07281279563903809},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1536414.1536482","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536482","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.cmu.edu:compsci-2150","is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=2150&context=compsci","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6604388","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Journal contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.6323","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.6323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~odonnell/papers/3bit-hardness.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.908","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~yiwu/paper/d3csp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.8256","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.8256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1556276033","https://openalex.org/W1571873445","https://openalex.org/W1967935161","https://openalex.org/W1970259241","https://openalex.org/W1982311066","https://openalex.org/W1987579904","https://openalex.org/W1999032440","https://openalex.org/W2004804919","https://openalex.org/W2014086530","https://openalex.org/W2019578639","https://openalex.org/W2073903404","https://openalex.org/W2081684569","https://openalex.org/W2087038607","https://openalex.org/W2091921997","https://openalex.org/W2110871651","https://openalex.org/W2111385661","https://openalex.org/W2117290960","https://openalex.org/W2120358419","https://openalex.org/W2133263321","https://openalex.org/W2133344054","https://openalex.org/W2137118456","https://openalex.org/W2137373403","https://openalex.org/W2144539217","https://openalex.org/W2146489710","https://openalex.org/W2148352980","https://openalex.org/W2152243261","https://openalex.org/W2154276597","https://openalex.org/W2162117620","https://openalex.org/W2327680971","https://openalex.org/W2501499209","https://openalex.org/W2951239126","https://openalex.org/W4252728767"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2963411648","https://openalex.org/W2016001296","https://openalex.org/W2019123979","https://openalex.org/W3125240838","https://openalex.org/W1606488336","https://openalex.org/W1567439696","https://openalex.org/W2359324386"],"abstract_inverted_index":{"In":[0,27,83],"this":[1,34,84],"paper":[2,85],"we":[3,86,95],"study":[4],"a":[5],"fundamental":[6],"open":[7,126],"problem":[8,35],"in":[9],"the":[10,18,28,40,88,131,145],"area":[11],"of":[12,30,32,133],"probabilistic":[13],"checkable":[14],"proofs:":[15],"What":[16],"is":[17,36,55,151],"smallest":[19,41],"s":[20,42,66],"such":[21,43],"that":[22,44,97,144],"NP":[23,77,110],"\u2286":[24],"naPCP1,s[O(log":[25],"n),3]?":[26],"language":[29],"hardness":[31],"approximation,":[33],"equivalent":[37],"to":[38],"determining":[39,130],"getting":[45],"an":[46],"s-approximation":[47],"for":[48,65,103,114,148],"satisfiable":[49,134,149],"3-bit":[50],"constraint":[51],"satisfaction":[52],"problems":[53],"(\"3-CSPs\")":[54],"NP-hard.":[56],"The":[57],"previous":[58],"best":[59],"upper":[60],"bound":[61,64],"and":[62,71,74,139],"lower":[63],"are":[67],"20/27+\u00b5":[68],"by":[69,80],"Khot":[70],"Saket":[72],"[KS06],":[73],"5/8":[75],"(assuming":[76],"subseteq":[78],"BPP)":[79],"Zwick":[81],"[Zwi98].":[82],"close":[87],"gap":[89],"assuming":[90],"Khot's":[91,99],"d-to-1":[92,100],"Conjecture.":[93],"Formally,":[94],"prove":[96],"if":[98],"Conjecture":[101],"holds":[102],"any":[104,115],"finite":[105],"constant":[106,116],"integer":[107],"d,":[108],"then":[109],"naPCP1,5/8+":[111],"\u00b5[O(log":[112],"n),3]":[113],"\u00b5":[117],">":[118],"0.":[119],"Our":[120],"conditional":[121],"result":[122],"also":[123],"solves":[124],"Hastad's":[125],"question":[127],"[Has01]":[128],"on":[129],"inapproximability":[132],"Max-NTW":[135],"(\"Not":[136],"Two\")":[137],"instances":[138],"confirms":[140],"Zwick's":[141],"conjecture":[142],"[Zwi98]":[143],"5/8-approximation":[146],"algorithm":[147],"3-CSPs":[150],"optimal.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}