{"id":"https://openalex.org/W2913322957","doi":"https://doi.org/10.1145/3313276.3316401","title":"CSPs with global modular constraints: algorithms and hardness via polynomial representations","display_name":"CSPs with global modular constraints: algorithms and hardness via polynomial representations","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2913322957","doi":"https://doi.org/10.1145/3313276.3316401","mag":"2913322957"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316401","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316401","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316401","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316401","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038687630","display_name":"Sivakanth Gopi","orcid":"https://orcid.org/0000-0001-9706-4171"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sivakanth Gopi","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9386,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67941387,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"590","last_page":"601"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/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/T11797","display_name":"graph theory and CDMA systems","score":0.9947999715805054,"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.6631983518600464},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.5704836845397949},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.5328569412231445},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5069732666015625},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.47822684049606323},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47055816650390625},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4575023949146271},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.436459481716156},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42326176166534424},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40207111835479736},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39044928550720215},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.30839359760284424},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2117789089679718},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.19210350513458252}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6631983518600464},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.5704836845397949},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.5328569412231445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5069732666015625},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.47822684049606323},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47055816650390625},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4575023949146271},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.436459481716156},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42326176166534424},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40207111835479736},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39044928550720215},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.30839359760284424},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2117789089679718},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.19210350513458252},{"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.1145/3313276.3316401","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316401","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316401","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3313276.3316401","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316401","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316401","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"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/G5200908636","display_name":"CIF/AF: Small: Some fundamental complexity-inspired coding theory challenges","funder_award_id":"1422045","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6087576244","display_name":null,"funder_award_id":"CCF-1526092,CAREER award 1451191, CCF-1523816, CCF-1422045, CCF-1526092","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/G6688699574","display_name":"AF: Small: Approximate optimization: Algorithms, Hardness, and Integrality Gaps","funder_award_id":"1526092","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8047500120","display_name":"AF:  Small:  New Techniques for Private Information Retrieval and Locally Decodable Codes","funder_award_id":"1523816","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":"CAREER: New algebraic techniques for line-point incidence problems","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"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320309292","display_name":"Princeton University","ror":"https://ror.org/00hx57361"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2913322957.pdf","grobid_xml":"https://content.openalex.org/works/W2913322957.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W154107037","https://openalex.org/W791130099","https://openalex.org/W1589711670","https://openalex.org/W1645064872","https://openalex.org/W1967703498","https://openalex.org/W1996712932","https://openalex.org/W1997649256","https://openalex.org/W1998698985","https://openalex.org/W2000211775","https://openalex.org/W2011033415","https://openalex.org/W2011895441","https://openalex.org/W2026753685","https://openalex.org/W2027317757","https://openalex.org/W2054996571","https://openalex.org/W2061768978","https://openalex.org/W2069582894","https://openalex.org/W2121804749","https://openalex.org/W2150339067","https://openalex.org/W2152439289","https://openalex.org/W2153413398","https://openalex.org/W2166566648","https://openalex.org/W2177108502","https://openalex.org/W2570927556","https://openalex.org/W2626905092","https://openalex.org/W2809318426","https://openalex.org/W2962785950","https://openalex.org/W2962909288","https://openalex.org/W2972131259","https://openalex.org/W4230909286"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2963553930","https://openalex.org/W2105471374","https://openalex.org/W4377235134","https://openalex.org/W4310923039","https://openalex.org/W2346604551","https://openalex.org/W3103742664","https://openalex.org/W2172754641","https://openalex.org/W2111330432","https://openalex.org/W2069490433"],"abstract_inverted_index":{"We":[0,56],"study":[1,44,79],"the":[2,11,27,32,43,58,76,110,116,127,132,157,165,186],"complexity":[3,99,112,193],"of":[4,26,35,45,113,129,147,159,195],"Boolean":[5,37],"constraint":[6,84],"satisfaction":[7],"problems":[8,65],"(CSPs)":[9],"when":[10,71],"assignment":[12],"must":[13],"have":[14],"Hamming":[15],"weight":[16,144],"in":[17,138],"some":[18],"congruence":[19],"class":[20],"modulo":[21],"M,":[22,136],"for":[23,61,182],"various":[24],"choices":[25],"modulus":[28],"M.":[29,120],"Due":[30],"to":[31,42,89,98,109,126,142],"known":[33],"classification":[34],"tractable":[36],"CSPs,":[38],"this":[39,82],"mainly":[40],"reduces":[41],"three":[46],"cases:":[47],"2-SAT,":[48],"HORN-SAT,":[49],"and":[50,70,101,150,185],"LIN-2":[51,122],"(linear":[52],"equations":[53],"mod":[54,119,135],"2).":[55],"classify":[57],"moduli":[59],"M":[60],"which":[62,137,188],"these":[63,90,170],"respective":[64],"are":[66,73],"polynomial":[67,171,196],"time":[68],"solvable,":[69],"they":[72],"not":[74],"(assuming":[75],"ETH).":[77],"Our":[78],"reveals":[80],"that":[81],"modular":[83,143],"lends":[85],"a":[86],"surprising":[87],"richness":[88],"classic,":[91],"well-studied":[92],"problems,":[93],"with":[94],"interesting":[95,175],"broader":[96],"connections":[97,141],"theory":[100],"coding":[102],"theory.":[103],"The":[104,121],"HORN-SAT":[105],"case":[106,123],"is":[107,124],"connected":[108],"covering":[111],"polynomials":[114,130],"representing":[115,131],"NAND":[117],"function":[118,134],"tied":[125],"sparsity":[128],"OR":[133],"turn":[139],"has":[140],"distribution":[145],"properties":[146],"linear":[148],"codes":[149],"locally":[151],"decodable":[152],"codes.":[153],"In":[154],"both":[155],"cases,":[156],"analysis":[158],"our":[160,183],"algorithm":[161],"as":[162,164],"well":[163],"hardness":[166],"reduction":[167],"rely":[168],"on":[169],"representations,":[172],"highlighting":[173],"an":[174],"algebraic":[176],"common":[177],"ground":[178],"between":[179],"hard":[180],"cases":[181],"algorithms":[184],"gadgets":[187],"show":[189],"hardness.":[190],"These":[191],"new":[192],"measures":[194],"representations":[197],"merit":[198],"further":[199],"study.":[200]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}