{"id":"https://openalex.org/W4281885517","doi":"https://doi.org/10.1145/3519935.3520028","title":"On approximability of satisfiable <i>k</i> -CSPs: I","display_name":"On approximability of satisfiable <i>k</i> -CSPs: I","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281885517","doi":"https://doi.org/10.1145/3519935.3520028"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520028","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520028","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520028","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520028","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012510300","display_name":"Amey Bhangale","orcid":"https://orcid.org/0000-0002-3878-9241"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amey Bhangale","raw_affiliation_strings":["University of California at Riverside, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["New York University, USA"],"affiliations":[{"raw_affiliation_string":"New York University, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063520549","display_name":"Dor Minzer","orcid":"https://orcid.org/0000-0002-8093-1328"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dor Minzer","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012510300"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":3.3189,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.93118499,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"976","last_page":"988"},"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.9997000098228455,"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.9997000098228455,"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.9987000226974487,"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.991100013256073,"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/soundness","display_name":"Soundness","score":0.7471699714660645},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7263476848602295},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6564913988113403},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5347752571105957},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5287850499153137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48925018310546875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.453485906124115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4476388096809387},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08786994218826294},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.073018878698349}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7471699714660645},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7263476848602295},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6564913988113403},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5347752571105957},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5287850499153137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48925018310546875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.453485906124115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4476388096809387},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08786994218826294},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.073018878698349},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520028","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520028","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520028","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3519935.3520028","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520028","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520028","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G3053648282","display_name":"AF: Small: Analysis, Geometry, and Hardness of Approximation","funder_award_id":"1813438","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"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4281885517.pdf","grobid_xml":"https://content.openalex.org/works/W4281885517.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1521487341","https://openalex.org/W1549730417","https://openalex.org/W1973898585","https://openalex.org/W1979065044","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2019578639","https://openalex.org/W2086653003","https://openalex.org/W2087038607","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2133263321","https://openalex.org/W2148352980","https://openalex.org/W2150339067","https://openalex.org/W2154276597","https://openalex.org/W2166566648","https://openalex.org/W2179897858","https://openalex.org/W2400082414","https://openalex.org/W2962785950","https://openalex.org/W3081785465","https://openalex.org/W3089642129","https://openalex.org/W3133822674","https://openalex.org/W3185022466","https://openalex.org/W3207594656"],"related_works":["https://openalex.org/W13634261","https://openalex.org/W3163509751","https://openalex.org/W958050847","https://openalex.org/W1548499332","https://openalex.org/W2396405675","https://openalex.org/W1549730417","https://openalex.org/W1994524667","https://openalex.org/W3145683101","https://openalex.org/W4298974867","https://openalex.org/W2129933223"],"abstract_inverted_index":{"We":[0,12],"consider":[1],"the":[2,27,79,97],"P-CSP":[3,28],"problem":[4],"for":[5,46],"3-ary":[6],"predicates":[7],"P":[8,19],"on":[9,18,73],"satisfiable":[10,74,112],"instances.":[11],"show":[13],"that":[14],"under":[15],"certain":[16],"conditions":[17],"and":[20,43,87],"a":[21,35,101],"(1,s)":[22],"integrality":[23],"gap":[24],"instance":[25],"of":[26,100,106,110],"problem,":[29],"it":[30],"can":[31,93],"be":[32,94],"translated":[33],"into":[34],"dictatorship":[36],"vs.":[37],"quasirandomness":[38],"test":[39,68],"with":[40],"perfect":[41,60],"completeness":[42],"soundness":[44],"s+\u03b5,":[45],"every":[47,111],"constant":[48],"\u03b5>0.":[49],"Compared":[50],"to":[51],"Ragahvendra\u2019s":[52],"result":[53,92],"[STOC,":[54],"2008],":[55],"we":[56],"do":[57],"not":[58],"lose":[59],"completeness.":[61],"This":[62],"is":[63],"particularly":[64],"interesting":[65],"as":[66,96],"this":[67],"implies":[69],"new":[70],"hardness":[71],"results":[72],"constraint":[75],"satisfaction":[76],"problems,":[77],"assuming":[78],"Rich":[80],"2-to-1":[81],"Games":[82],"Conjecture":[83],"by":[84],"Braverman,":[85],"Khot,":[86],"Minzer":[88],"[ITCS,":[89],"2021].":[90],"Our":[91],"seen":[95],"first":[98],"step":[99],"potentially":[102],"long-term":[103],"challenging":[104],"program":[105],"characterizing":[107],"optimal":[108],"inapproximability":[109],"k-ary":[113],"CSP.":[114]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":10}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}