{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:07Z","timestamp":1750220767777,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100012555","name":"Russian Foundation for Fundamental Investigations","doi-asserted-by":"publisher","award":["19-01-00200"],"award-info":[{"award-number":["19-01-00200"]}],"id":[{"id":"10.13039\/100012555","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["771005"],"award-info":[{"award-number":["771005"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384232","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["QCSP monsters and the demise of the chen conjecture"],"prefix":"10.1145","author":[{"given":"Dmitriy","family":"Zhuk","sequence":"first","affiliation":[{"name":"Moscow State University, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[{"name":"Durham University, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Krokhin","author":"B\u00f6rner Ferdinand","year":"2009","unstructured":"Ferdinand B\u00f6rner , Andrei A. Bulatov , Hubie Chen , Peter Jeavons , and Andrei A . Krokhin . 2009 . The complexity of constraint satisfaction games and QCSP. Inf. Comput . 207, 9 ( 2009 ), 923-944. Ferdinand B\u00f6rner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, and Andrei A. Krokhin. 2009. The complexity of constraint satisfaction games and QCSP. Inf. Comput. 207, 9 ( 2009 ), 923-944."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1137\/1.9781611975031.117"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/FOCS.2017.37"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1016\/0890-5401(91)90075-D"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/LICS.2015.50"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.4230\/LIPIcs.MFCS.2017.27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/978-3-540-30201-8_15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1189056.1189076"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1137\/060668572"},{"doi-asserted-by":"crossref","unstructured":"Hubie Chen. 2011. Quantified constraint satisfaction and the polynomially generated powers property. Algebra universalis 65 3 ( 2011 ) 213-241. https: \/\/doi.org\/10.1007\/s00012-011-0125-4 An extended abstract appeared in ICALP B 2008. 10.1007\/s00012-011-0125-4","key":"#cr-split#-e_1_3_2_1_10_1.1","DOI":"10.1007\/s00012-011-0125-4"},{"doi-asserted-by":"crossref","unstructured":"Hubie Chen. 2011. Quantified constraint satisfaction and the polynomially generated powers property. Algebra universalis 65 3 ( 2011 ) 213-241. https: \/\/doi.org\/10.1007\/s00012-011-0125-4 An extended abstract appeared in ICALP B 2008.","key":"#cr-split#-e_1_3_2_1_10_1.2","DOI":"10.1007\/s00012-011-0125-4"},{"volume-title":"Logic and Program Semantics-Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday. 35-49.","author":"Chen Hubie","unstructured":"Hubie Chen . 2012. Meditations on Quantified Constraint Satisfaction . In Logic and Program Semantics-Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday. 35-49. Hubie Chen. 2012. Meditations on Quantified Constraint Satisfaction. In Logic and Program Semantics-Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday. 35-49.","key":"e_1_3_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.2168\/LMCS-11(3:9)2015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.4230\/LIPIcs.CSL.2016.15"},{"doi-asserted-by":"crossref","unstructured":"David Geiger. 1968. Closed systems of functions and predicates. Pacific journal of mathematics 27 1 ( 1968 ) 95-100.  David Geiger. 1968. Closed systems of functions and predicates. Pacific journal of mathematics 27 1 ( 1968 ) 95-100.","key":"e_1_3_2_1_14_1","DOI":"10.2140\/pjm.1968.27.95"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1137\/16M1091836"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1093\/logcom\/exw005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.tcs.2017.06.023"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1137\/140965715"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.4230\/DFU.Vol7.15301.327"},{"volume-title":"Computational Complexity","author":"Papadimitriou Christos H.","unstructured":"Christos H. Papadimitriou . 1994. Computational Complexity . Addison-Wesley . Christos H. Papadimitriou. 1994. Computational Complexity. Addison-Wesley.","key":"e_1_3_2_1_20_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1109\/FOCS.2017.38"},{"key":"e_1_3_2_1_22_1","series-title":"Series A 167 ( 2019 )","first-page":"91","volume-title":"The size of generating sets of powers. Journal of Combinatorial Theory","author":"Zhuk Dmitriy","unstructured":"Dmitriy Zhuk . 2019. The size of generating sets of powers. Journal of Combinatorial Theory , Series A 167 ( 2019 ) , 91 - 103 . Dmitriy Zhuk. 2019. The size of generating sets of powers. Journal of Combinatorial Theory, Series A 167 ( 2019 ), 91-103."},{"key":"e_1_3_2_1_23_1","volume-title":"QCSP monsters and the demise of the Chen Conjecture. CoRR abs\/","author":"Zhuk Dmitriy","year":"1907","unstructured":"Dmitriy Zhuk and Barnaby Martin . 2019. QCSP monsters and the demise of the Chen Conjecture. CoRR abs\/ 1907 .00239 ( 2019 ). arXiv: 1907.00239 http:\/\/arxiv.org\/abs\/ 1907.00239 Dmitriy Zhuk and Barnaby Martin. 2019. QCSP monsters and the demise of the Chen Conjecture. CoRR abs\/ 1907.00239 ( 2019 ). arXiv: 1907.00239 http:\/\/arxiv.org\/abs\/ 1907.00239"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '20","name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384232","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":24,"alternative-id":["10.1145\/3357713.3384232","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384232","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}