{"id":"https://openalex.org/W7163992805","doi":"https://doi.org/10.1145/3798129.3800728","title":"Near Optimal Hardness of Approximating \ud835\udc58-CSP","display_name":"Near Optimal Hardness of Approximating \ud835\udc58-CSP","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7163992805","doi":"https://doi.org/10.1145/3798129.3800728"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800728","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800728","pdf_url":null,"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 58th Annual ACM 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://doi.org/10.1145/3798129.3800728","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","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, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-8093-1328","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039861331","display_name":"Kai Zhe Zheng","orcid":"https://orcid.org/0000-0002-0436-8131"},"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":"Kai Zhe Zheng","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-0436-8131","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.94826661,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"72","last_page":"83"},"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.6488000154495239,"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.6488000154495239,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.052299998700618744,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.02070000022649765,"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/fraction","display_name":"Fraction (chemistry)","score":0.6916000247001648},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6791999936103821},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6363999843597412},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.49070000648498535},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.3504999876022339},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.3287999927997589}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8307999968528748},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.6916000247001648},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6791999936103821},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6363999843597412},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5806000232696533},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.49070000648498535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40119999647140503},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800728","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800728","pdf_url":null,"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 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800728","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800728","pdf_url":null,"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 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.785435676574707,"id":"https://metadata.un.org/sdg/13","display_name":"Climate action"}],"awards":[{"id":"https://openalex.org/G7317299890","display_name":null,"funder_award_id":"2227876","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1582339485","https://openalex.org/W1970259241","https://openalex.org/W1999032440","https://openalex.org/W2019578639","https://openalex.org/W2086423976","https://openalex.org/W2086653003","https://openalex.org/W2148352980","https://openalex.org/W2153413398","https://openalex.org/W2405388088","https://openalex.org/W2405977959","https://openalex.org/W2514739098","https://openalex.org/W2625656873","https://openalex.org/W2809286765","https://openalex.org/W2963493303","https://openalex.org/W3170971055","https://openalex.org/W4226060934","https://openalex.org/W4311539176","https://openalex.org/W4316652258","https://openalex.org/W4378449969","https://openalex.org/W4399523282","https://openalex.org/W4404849416","https://openalex.org/W4411319942"],"related_works":[],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,28,83],"for":[3,8,118,128],"every":[4],"k\u2208\u2115":[5],"and":[6,41,76,105],"\u03b5>0,":[7],"large":[9],"enough":[10],"alphabet":[11,17],"R,":[12,19],"given":[13],"a":[14,101,125],"k-CSP":[15],"with":[16,71],"size":[18],"it":[20],"is":[21,30,116,124],"NP-hard":[22],"to":[23],"distinguish":[24],"between":[25,130],"the":[26,39,42,51,63,68,79,93,98,110,113,134],"case":[27,43],"there":[29],"an":[31,85],"assignment":[32,45,86],"satisfying":[33,87],"at":[34,88],"least":[35,89],"1\u2212\u03b5":[36],"fraction":[37,91],"of":[38,50,59,62,74,92,100,109,140],"constraints,":[40],"no":[44],"satisfies":[46],"more":[47],"than":[48],"1/Rk\u22121\u2212\u03b5":[49],"constraints.":[52,94],"This":[53],"result":[54,70,115],"improves":[55],"upon":[56],"prior":[57],"work":[58,103],"[Chan,":[60],"Journal":[61],"ACM":[64],"2016],":[65],"who":[66],"showed":[67],"same":[69],"weaker":[72],"soundness":[73],"O(k/Rk\u22122),":[75],"nearly":[77],"matches":[78],"trivial":[80],"approximation":[81],"algorithm":[82],"finds":[84],"1/Rk\u22121":[90],"Our":[95,120],"proof":[96],"follows":[97],"approach":[99],"recent":[102],"[Minzer":[104],"Zheng,":[106],"STOC":[107],"2024]":[108],"authors,":[111],"wherein":[112],"above":[114],"proved":[117],"k=2.":[119],"main":[121],"new":[122],"ingredient":[123],"counting":[126],"lemma":[127],"hyperedges":[129],"pseudo-random":[131],"sets":[132],"in":[133],"Grassmann":[135],"graphs,":[136],"which":[137],"may":[138],"be":[139],"independent":[141],"interest.":[142]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}