{"id":"https://openalex.org/W4412543997","doi":"https://doi.org/10.1007/s00037-025-00267-6","title":"On approximability of Satisfiable $$k$$-CSPs: I","display_name":"On approximability of Satisfiable $$k$$-CSPs: I","publication_year":2025,"publication_date":"2025-07-22","ids":{"openalex":"https://openalex.org/W4412543997","doi":"https://doi.org/10.1007/s00037-025-00267-6"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-025-00267-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00267-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00267-6.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00267-6.pdf","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Amey Bhangale","raw_affiliation_strings":["Department of Computer Science, University of California, Riverside, Riverside, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Riverside, Riverside, CA, 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/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"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":["Courant Institute of Mathematical Sciences, New York University, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University, New York, NY, USA","institution_ids":["https://openalex.org/I36672615","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":true,"raw_author_name":"Dor Minzer","raw_affiliation_strings":["Department of Mathematics, Massachusetts Institute of Technology, Cambrdige, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Massachusetts Institute of Technology, Cambrdige, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063520549"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17735359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"2","first_page":null,"last_page":null},"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.9995999932289124,"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.9995999932289124,"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.9987999796867371,"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.9926999807357788,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5142242908477783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4341667890548706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4136633574962616},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3914220929145813}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5142242908477783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4341667890548706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4136633574962616},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3914220929145813}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00037-025-00267-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00267-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00267-6.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/145803","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/145803","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"pmh:oai:dspace.mit.edu:1721.1/163767","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/163767","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Springer International Publishing","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"doi:10.1007/s00037-025-00267-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00267-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00267-6.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5169580875","display_name":null,"funder_award_id":"2239160","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5365765433","display_name":"AF: Small: Challenges in Hardness of Approximation","funder_award_id":"1422159","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7317299890","display_name":null,"funder_award_id":"2227876","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7595642436","display_name":"AF: Small: Hardness of Approximation: Classical and New","funder_award_id":"2130816","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/W4412543997.pdf","grobid_xml":"https://content.openalex.org/works/W4412543997.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W183568742","https://openalex.org/W1546321060","https://openalex.org/W1973898585","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2019578639","https://openalex.org/W2069992656","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/W2166566648","https://openalex.org/W2179897858","https://openalex.org/W2962785950","https://openalex.org/W3081785465","https://openalex.org/W3089642129","https://openalex.org/W3207594656"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"Abstract":[0],"We":[1,22],"consider":[2],"the":[3,51,103,139,175,199,202],"$$P$$":[4,14,29,52],"<mml:math":[5,15,30,37,53,75,88,192],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[6,16,31,38,54,76,89,193],"<mml:mi>P</mml:mi>":[7,17,32,55],"</mml:math>":[8,18,33,46,56,82,95,195],"-CSP":[9,57],"problem":[10],"for":[11,84,209],"3-ary":[12,213],"predicates":[13],"on":[19,28,108,133],"satisfiable":[20,134,190],"instances.":[21],"show":[23],"that":[24,237],"under":[25],"certain":[26],"conditions":[27],"and":[34,72,231],"a":[35,64,179,210,217,220,232],"$$(1,s)$$":[36],"<mml:mrow>":[39,77,90],"<mml:mo>(</mml:mo>":[40],"<mml:mn>1</mml:mn>":[41],"<mml:mo>,</mml:mo>":[42],"<mml:mi>s</mml:mi>":[43,78],"<mml:mo>)</mml:mo>":[44],"</mml:mrow>":[45,81,94],"integrality":[47],"gap":[48],"instance":[49],"of":[50,102,110,154,178,184,188,201,212,219,235,242],"problem,":[58],"it":[59,236],"can":[60,171],"be":[61,172,241],"translated":[62],"into":[63],"dictatorship":[65],"vs.":[66],"quasirandomness":[67],"test":[68,128],"with":[69],"perfect":[70,120],"completeness":[71],"soundness":[73],"$$s+\\epsilon$$":[74],"<mml:mo>+</mml:mo>":[79],"<mml:mi>\u03f5</mml:mi>":[80,91],",":[83],"every":[85,189],"constant":[86],"$$\\epsilon&gt;0$$":[87],"<mml:mo>&gt;</mml:mo>":[92],"<mml:mn>0</mml:mn>":[93],".":[96],"Compared":[97],"to":[98],"Ragahvendra":[99],"(in:":[100,148],"Proceedings":[101],"fortieth":[104],"annual":[105],"ACM":[106],"symposium":[107],"theory":[109],"computing":[111],"(STOC),":[112],"pp":[113],"245\u2013254,":[114],"2008),":[115],"we":[116,238],"do":[117],"not":[118],"lose":[119],"completeness.":[121],"This":[122],"is":[123,204,216],"particularly":[124],"interesting":[125],"as":[126,174],"this":[127],"implies":[129],"new":[130],"hardness":[131],"results":[132],"constraint":[135],"satisfaction":[136],"problems,":[137],"assuming":[138],"Rich":[140],"2-to-1":[141],"Games":[142],"Conjecture":[143],"by":[144,222],"Braverman":[145],"et":[146],"al.":[147],"Lee":[149],"JR":[150],"(ed)":[151],"Volume":[152],"185":[153],"Leibniz":[155],"international":[156],"proceedings":[157],"in":[158],"informatics":[159],"(LIPIcs),":[160],"27:1\u201327:20.":[161],"Schloss":[162],"Dagstuhl\u2013Leibniz-Zentrum":[163],"f\u00fcr":[164],"Informatik,":[165],"Dagstuhl,":[166],"2021b.":[167],"https://drops.dagstuhl.de/opus/volltexte/2021/13566":[168],").Our":[169],"result":[170],"seen":[173],"first":[176],"step":[177],"potentially":[180],"long-term":[181],"challenging":[182],"program":[183],"characterizing":[185],"optimal":[186],"inapproximability":[187],"$$k$$":[191],"<mml:mi>k</mml:mi>":[194],"-ary":[196],"CSP.":[197],"At":[198],"heart":[200],"reduction":[203],"our":[205],"main":[206],"analytical":[207],"lemma":[208,221,230],"class":[211],"predicates,":[214],"which":[215],"generalization":[218,234],"Mossel":[223],"(Geom":[224],"Funct":[225],"Anal":[226],"19(6):1713\u20131756,":[227],"2010).":[228],"The":[229],"further":[233],"conjecture":[239],"may":[240],"independent":[243],"interest.":[244]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}