{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:17:20Z","timestamp":1773159440042,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1526092,CAREER award 1451191, CCF-1523816, CCF-1422045, CCF-1526092"],"award-info":[{"award-number":["CCF-1526092,CAREER award 1451191, CCF-1523816, CCF-1422045, CCF-1526092"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316401","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"590-601","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["CSPs with global modular constraints: algorithms and hardness via polynomial representations"],"prefix":"10.1145","author":[{"given":"Joshua","family":"Brakensiek","sequence":"first","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivakanth","family":"Gopi","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Stephan Artmann Robert Weismantel and Rico Zenklusen. 2017.  Stephan Artmann Robert Weismantel and Rico Zenklusen. 2017."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055473"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263424"},{"key":"e_1_3_2_1_4_1","unstructured":"Libor Barto Andrei A. Krokhin and Ross Willard. 2017.  Libor Barto Andrei A. Krokhin and Ross Willard. 2017."},{"key":"e_1_3_2_1_5_1","volume-title":"The Constraint Satisfaction Problem: Complexity and Approximability, Andrei A","author":"Use Them How","unstructured":"Polymorphisms, and How to Use Them . In The Constraint Satisfaction Problem: Complexity and Approximability, Andrei A . Krokhin and Stanislav Zivny (Eds.). Dagstuhl Follow-Ups, Vol . 7. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 1\u201344. U.Vol 7.15301.1 Polymorphisms, and How to Use Them. In The Constraint Satisfaction Problem: Complexity and Approximability, Andrei A. Krokhin and Stanislav Zivny (Eds.). Dagstuhl Follow-Ups, Vol. 7. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 1\u201344. U.Vol7.15301.1"},{"key":"e_1_3_2_1_6_1","unstructured":"Abhishek Bhowmick Zeev Dvir and Shachar Lovett. 2014.  Abhishek Bhowmick Zeev Dvir and Shachar Lovett. 2014."},{"key":"e_1_3_2_1_7_1","volume-title":"1654\u20131683","author":"Comput New","year":"2014","unstructured":"New bounds for matching vector families. SIAM J. Comput . 43, 5 ( 2014 ), 1654\u20131683 . New bounds for matching vector families. SIAM J. Comput. 43, 5 (2014), 1654\u20131683."},{"key":"e_1_3_2_1_8_1","unstructured":"A. Bulatov P. Jeavons and A. Krokhin. 2005.  A. Bulatov P. Jeavons and A. Krokhin. 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120582.1120584"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Andrei A. Bulatov. 2017. A Dichotomy Theorem for Nonuniform CSPs See { 29 } 319\u2013330.  Andrei A. Bulatov. 2017. A Dichotomy Theorem for Nonuniform CSPs See { 29 } 319\u2013330.","DOI":"10.1109\/FOCS.2017.37"},{"key":"e_1_3_2_1_12_1","volume-title":"Bulatov and Daniel Marx","author":"Andrei","year":"2010","unstructured":"Andrei A. Bulatov and Daniel Marx . 2010 . The complexity of global cardinality constraints. Logical Methods in Computer Scienced Volume 6, Issue 4 (Oct. 2010). 6(4:4)2010 Andrei A. Bulatov and Daniel Marx. 2010. The complexity of global cardinality constraints. Logical Methods in Computer Scienced Volume 6, Issue 4 (Oct. 2010). 6(4:4)2010"},{"key":"e_1_3_2_1_13_1","unstructured":"Arkadev Chattopadhyay Navin Goyal Pavel Pudl\u00e1k and Denis Th\u00e9rien. 2006.  Arkadev Chattopadhyay Navin Goyal Pavel Pudl\u00e1k and Denis Th\u00e9rien. 2006."},{"key":"e_1_3_2_1_14_1","volume-title":"47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings. 709\u2013718","author":"Lower","unstructured":"Lower bounds for circuits with MOD_m gates . In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings. 709\u2013718 . Lower bounds for circuits with MOD_m gates. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings. 709\u2013718."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.17"},{"key":"e_1_3_2_1_16_1","volume-title":"Two Structural Results for Low Degree Polynomials and Applications. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Cohen Gil","year":"2015","unstructured":"Gil Cohen and Avishay Tal . 2015. Two Structural Results for Low Degree Polynomials and Applications. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ( 2015 ), 680. Gil Cohen and Avishay Tal. 2015. Two Structural Results for Low Degree Polynomials and Applications. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2015), 680."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1805950.1805954"},{"key":"e_1_3_2_1_18_1","unstructured":"1805954  1805954"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/100804322"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2968443"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"e_1_3_2_1_23_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"16","author":"Gopalan Parikshit","year":"2009","unstructured":"Parikshit Gopalan . 2009 . A note on Efremenko\u2019s Locally Decodable Codes .. In Electronic Colloquium on Computational Complexity (ECCC) , Vol. 16 . Parikshit Gopalan. 2009. A note on Efremenko\u2019s Locally Decodable Codes.. In Electronic Colloquium on Computational Complexity (ECCC), Vol. 16."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2367-1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070032"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-015-9638-0"},{"key":"e_1_3_2_1_27_1","unstructured":"Jonathan Katz and Luca Trevisan. 2000.  Jonathan Katz and Luca Trevisan. 2000."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"e_1_3_2_1_29_1","unstructured":"Iordanis Kerenidis and Ronald De Wolf. 2004.  Iordanis Kerenidis and Ronald De Wolf. 2004."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.007"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188936"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754402"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 849\u2013866","author":"N\u00e4gele Martin","year":"2018","unstructured":"Martin N\u00e4gele , Benny Sudakov , and Rico Zenklusen . 2018 . Submodular minimization under congruency constraints . In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 849\u2013866 . Martin N\u00e4gele, Benny Sudakov, and Rico Zenklusen. 2018. Submodular minimization under congruency constraints. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 849\u2013866."},{"key":"e_1_3_2_1_34_1","unstructured":"Emil L Post. 1941.  Emil L Post. 1941."},{"key":"e_1_3_2_1_35_1","volume-title":"Number 5 in Annals of Mathematics Studies","author":"The","unstructured":"The two-valued iterative systems of mathematical logic. Number 5 in Annals of Mathematics Studies . Princeton University Press . The two-valued iterative systems of mathematical logic. Number 5 in Annals of Mathematics Studies. Princeton University Press."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001597"},{"key":"e_1_3_2_1_38_1","unstructured":"Chris Umans (Ed.). 2017.  Chris Umans (Ed.). 2017."},{"key":"e_1_3_2_1_39_1","volume-title":"IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017","year":"2017","unstructured":"58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017 , Berkeley, CA, USA , October 15-17, 2017 . IEEE Computer Society. http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=8100284 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. IEEE Computer Society. http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=8100284"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316401","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316401","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:33Z","timestamp":1750204473000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":40,"alternative-id":["10.1145\/3313276.3316401","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316401","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}