{"id":"https://openalex.org/W4416892631","doi":"https://doi.org/10.4230/lipics.approx/random.2025.5","title":"Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT","display_name":"Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416892631","doi":"https://doi.org/10.4230/lipics.approx/random.2025.5"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2504.19051","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.19051","pdf_url":"https://arxiv.org/pdf/2504.19051","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.19051","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101888189","display_name":"Aditya Anand","orcid":"https://orcid.org/0009-0005-4842-1298"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anand, Aditya","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Euiwoong","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120533330","display_name":"Davide Mazzali","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mazzali, Davide","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Sharma, Amatya","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sharma, Amatya","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101888189"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.4117549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6000999808311462,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6000999808311462,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.20389999449253082,"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.17080000042915344,"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/rounding","display_name":"Rounding","score":0.6988999843597412},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47130000591278076},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46869999170303345},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4489000141620636},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4124000072479248},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.3824000060558319},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.3160000145435333}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6988999843597412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5963000059127808},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47130000591278076},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4099999964237213},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38019999861717224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37059998512268066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3452000021934509},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3116999864578247},{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.31060001254081726},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30230000615119934},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25870001316070557}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2504.19051","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.19051","pdf_url":"https://arxiv.org/pdf/2504.19051","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},{"id":"doi:10.48550/arxiv.2504.19051","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.19051","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.approx/random.2025.5","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx/random.2025.5","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2504.19051","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.19051","pdf_url":"https://arxiv.org/pdf/2504.19051","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1,100],"studies":[2],"complete":[3,36,61,66,115,139,188,257],"$k$-Constraint":[4],"Satisfaction":[5],"Problems":[6],"(CSPs),":[7],"where":[8,149,205],"an":[9,53],"$n$-variable":[10],"instance":[11],"has":[12,25],"exactly":[13],"one":[14],"nontrivial":[15,81,111],"constraint":[16],"for":[17,79,84,114,197],"each":[18,206],"subset":[19],"of":[20,35,59,73,95,104,147,161,170,240,244],"$k$":[21],"variables,":[22,223],"i.e.,":[23],"it":[24,106],"$\\binom{n}{k}$":[26],"constraints.":[27,97],"A":[28],"recent":[29],"work":[30],"started":[31],"a":[32,44,132,171,185,193,199,251],"systematic":[33],"study":[34],"$k$-CSPs":[37],"[Anand,":[38],"Lee,":[39,246],"Sharma,":[40],"SODA'25],":[41],"and":[42,130,224,247,249],"showed":[43],"quasi-polynomial":[45,133],"time":[46,134,239],"algorithm":[47,191,253],"that":[48,254],"decides":[49,255],"if":[50],"there":[51],"is":[52,77,90,107,165,176],"assignment":[54],"satisfying":[55],"all":[56,150],"the":[57,85,93,102,145,151,155,159,166,202,209,214,225,237,241],"constraints":[58],"any":[60,80,256],"Boolean-alphabet":[62,258],"$k$-CSP,":[63],"algorithmically":[64],"separating":[65],"instances":[67,182],"from":[68,201],"dense":[69],"instances.":[70,189],"The":[71,98],"tractability":[72],"this":[74,122,128,164],"decision":[75,174,242],"problem":[76],"necessary":[78],"(multiplicative)":[82],"approximation":[83,112],"minimization":[86],"version,":[87],"whose":[88,173],"goal":[89],"to":[91,109,136,143,219,230],"minimize":[92,144],"number":[94,146],"violated":[96],"same":[99,156],"raised":[101],"question":[103],"whether":[105],"possible":[108],"obtain":[110],"algorithms":[113,243],"Min-$k$-CSPs":[116],"with":[117],"$k":[118],"\\geq":[119],"3$.":[120],"In":[121],"work,":[123],"we":[124,235],"make":[125],"progress":[126],"in":[127,178,187,217,228,260],"direction":[129],"show":[131,250],"$\\text{polylog}(n)$-approximation":[135,186],"Min-NAE-3-SAT":[137],"on":[138],"instances,":[140],"which":[141],"asks":[142],"$3$-clauses":[148],"three":[152],"literals":[153],"equal":[154],"bit.":[157],"To":[158],"best":[160],"our":[162],"knowledge,":[163],"first":[167],"known":[168],"example":[169],"CSP":[172],"version":[175],"NP-Hard":[177],"general":[179],"(and":[180],"dense)":[181],"while":[183],"admitting":[184],"Our":[190],"presents":[192],"new":[194],"iterative":[195],"framework":[196],"rounding":[198,212],"solution":[200],"Sherali-Adams":[203],"hierarchy,":[204],"iteration":[207],"interleaves":[208],"two":[210],"well-known":[211],"tools:":[213],"conditioning":[215],"procedure,":[216,227],"order":[218,229],"almost":[220],"fix":[221,232],"many":[222],"thresholding":[226],"completely":[231],"them.":[233],"Finally,":[234],"improve":[236],"running":[238],"Anand,":[245],"Sharma":[248],"simple":[252],"$k$-CSP":[259],"polynomial":[261],"time.":[262]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}