{"id":"https://openalex.org/W4280572229","doi":"https://doi.org/10.1137/19m1291054","title":"Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations","display_name":"Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations","publication_year":2022,"publication_date":"2022-05-19","ids":{"openalex":"https://openalex.org/W4280572229","doi":"https://doi.org/10.1137/19m1291054"},"language":"en","primary_location":{"id":"doi:10.1137/19m1291054","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1291054","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038687630","display_name":"Sivakanth Gopi","orcid":"https://orcid.org/0000-0001-9706-4171"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sivakanth Gopi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028220417"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1509,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47777697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"51","issue":"3","first_page":"577","last_page":"626"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/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/T11797","display_name":"graph theory and CDMA systems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7164780497550964},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.5204434990882874},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5029446482658386},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.47923019528388977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46975162625312805},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43697136640548706},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43595266342163086},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4191347360610962},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.4134080111980438},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38092535734176636},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17360293865203857},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.16899996995925903},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.16020572185516357}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7164780497550964},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5204434990882874},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5029446482658386},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.47923019528388977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46975162625312805},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43697136640548706},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43595266342163086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4191347360610962},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.4134080111980438},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38092535734176636},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17360293865203857},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.16899996995925903},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.16020572185516357},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/19m1291054","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1291054","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3089858946","display_name":null,"funder_award_id":"CCF-1523816","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6751408502","display_name":null,"funder_award_id":"CCF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7976889051","display_name":null,"funder_award_id":"CCF-1908125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8320020307","display_name":null,"funder_award_id":"CCF-1526092","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8513554395","display_name":null,"funder_award_id":"1451191","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":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W791130099","https://openalex.org/W1967703498","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W1996712932","https://openalex.org/W1997649256","https://openalex.org/W1998601876","https://openalex.org/W2001101327","https://openalex.org/W2008470071","https://openalex.org/W2011033415","https://openalex.org/W2018470381","https://openalex.org/W2025319967","https://openalex.org/W2026753685","https://openalex.org/W2027317757","https://openalex.org/W2028127968","https://openalex.org/W2054996571","https://openalex.org/W2061768978","https://openalex.org/W2063191044","https://openalex.org/W2069582894","https://openalex.org/W2077925882","https://openalex.org/W2127525529","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2153413398","https://openalex.org/W2177108502","https://openalex.org/W2570927556","https://openalex.org/W2626905092","https://openalex.org/W2809318426","https://openalex.org/W2942644636","https://openalex.org/W2972131259","https://openalex.org/W3161558599","https://openalex.org/W4230909286","https://openalex.org/W4240781210","https://openalex.org/W4245266864","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W4287599015","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W4313188786","https://openalex.org/W2963553930","https://openalex.org/W1574692149","https://openalex.org/W941231436","https://openalex.org/W2951186276","https://openalex.org/W4300378649","https://openalex.org/W4300777592"],"abstract_inverted_index":{"We":[0,56],"study":[1,44,81,207],"the":[2,11,27,32,43,58,76,112,118,129,134,159,167,188,271],"complexity":[3,101,114,195,272],"of":[4,26,35,45,115,131,149,161,197,241,258,273],"Boolean":[5,37],"constraint":[6,86],"satisfaction":[7],"problems":[8,65],"(CSPs)":[9],"when":[10,71],"assignment":[12],"must":[13],"have":[14],"Hamming":[15],"weight":[16,146],"in":[17,140,237,245],"some":[18],"congruence":[19,224],"class":[20],"modulo":[21,280],"$M$,":[22,138],"for":[23,61,184,205,228],"various":[24],"choices":[25],"modulus":[28],"$M$.":[29,122,283],"Due":[30],"to":[31,42,91,100,111,128,144,233,250,254],"known":[33],"classification":[34],"tractable":[36],"CSPs,":[38],"this":[39,84],"mainly":[40],"reduces":[41],"three":[46],"cases:":[47],"2-SAT,":[48],"HORN-SAT,":[49],"and":[50,70,103,152,187,216,236,262],"LIN-2":[51,124],"(linear":[52],"equations":[53],"mod":[54,121,137],"2).":[55],"classify":[57],"moduli":[59],"$M$":[60],"which":[62,139,190],"these":[63,92,172],"respective":[64],"are":[66,73],"polynomial":[67,173,198,251],"time":[68,78],"solvable,":[69],"they":[72],"not":[74,269],"(assuming":[75],"exponential":[77],"hypothesis).":[79],"Our":[80,226,248],"reveals":[82],"that":[83],"modular":[85,145],"lends":[87],"a":[88,210,222,255,277,281],"surprising":[89],"richness":[90],"classic,":[93],"well-studied":[94],"problems,":[95],"with":[96,221,276],"interesting":[97,177],"broader":[98],"connections":[99,143],"theory":[102],"coding":[104],"theory.":[105],"The":[106,123,203],"HORN-SAT":[107,229],"case":[108,125],"is":[109,126],"connected":[110],"covering":[113],"polynomials":[116,132],"representing":[117,133],"NAND":[119],"function":[120,136],"tied":[127],"sparsity":[130],"OR":[135],"turn":[141],"has":[142,230],"distribution":[147],"properties":[148],"linear":[150],"codes":[151],"locally":[153],"decodable":[154],"codes.":[155],"In":[156],"both":[157,246],"cases,":[158],"analysis":[160,257],"our":[162,185,206],"algorithm":[163,227],"as":[164,166],"well":[165],"hardness":[168],"reduction":[169],"rely":[170],"on":[171,218,266],"representations,":[174],"highlighting":[175],"an":[176],"algebraic":[178],"common":[179],"ground":[180],"between":[181],"hard":[182],"cases":[183],"algorithms":[186],"gadgets":[189],"show":[191],"hardness.":[192],"These":[193],"new":[194],"measures":[196],"representations":[199,252],"merit":[200],"further":[201],"study.":[202],"inspiration":[204],"comes":[208],"from":[209],"recent":[211],"work":[212],"by":[213],"N\u00e4gele,":[214],"Sudakov,":[215],"Zenklusen":[217],"submodular":[219,274],"minimization":[220,275],"global":[223],"constraint.":[225],"strong":[231],"similarities":[232],"their":[234],"algorithm,":[235],"particular":[238],"identical":[239],"kinds":[240],"set":[242,260],"systems":[243,261],"arise":[244],"cases.":[247],"connection":[249],"leads":[253],"simpler":[256],"such":[259],"also":[263],"sheds":[264],"light":[265],"(but":[267],"does":[268],"resolve)":[270],"congruency":[278],"requirement":[279],"composite":[282]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}