{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:37:32Z","timestamp":1787503052376,"version":"build-2736575974"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:00:00Z","timestamp":1583712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["334828"],"award-info":[{"award-number":["334828"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2020,4,30]]},"abstract":"<jats:p>\n                    We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study of weighted counting Constraint Satisfaction Problems. We explore the landscape of conservative holant clones and determine the situations in which a set\n                    <jats:italic>F<\/jats:italic>\n                    of functions is \u201cuniversal in the conservative case,\u201d which means that all functions are contained in the holant clone generated by\n                    <jats:italic>F<\/jats:italic>\n                    together with all unary functions. When\n                    <jats:italic>F<\/jats:italic>\n                    is not universal in the conservative case, we give concise generating sets for the clone. We demonstrate the usefulness of the holant clone theory by using it to give a complete complexity-theory classification for the problem of approximating the solution to conservative holant problems. We show that approximation is intractable exactly when\n                    <jats:italic>F<\/jats:italic>\n                    is universal in the conservative case.\n                  <\/jats:p>","DOI":"10.1145\/3381425","type":"journal-article","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T17:33:40Z","timestamp":1583775220000},"page":"1-55","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Holant Clones and the Approximability of Conservative Holant Problems"],"prefix":"10.1145","volume":"16","author":[{"given":"Miriam","family":"Backens","sequence":"first","affiliation":[{"name":"University of Birmingham, Oxford, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leslie Ann","family":"Goldberg","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP\u201917) (Leibniz International Proceedings in Informatics (LIPIcs))","author":"Backens Miriam"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP\u201918)","author":"Backens Miriam","year":"2018"},{"key":"e_1_2_1_3_1","article-title":"Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin","author":"Backens Miriam","year":"2019","journal-title":"J. Comput. Syst. Sci."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188788"},{"key":"e_1_2_1_5_1","volume-title":"Mark Jerrum, David Richerby, and Stanislav \u017divn\u00fd.","author":"Bulatov Andrei","year":"2017"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970398.1970400"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528400"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528401"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.011"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.49"},{"key":"e_1_2_1_11_1","volume-title":"Complexity Dichotomies for Counting Problems, Volume 1: Boolean Domain","author":"Cai Jin-Yi"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2822891"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/110840194"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9626-6"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.132"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.06.006"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"D. Cohen and P. Jeavons. 2006. The complexity of constraint languages. In Handbook of Constraint Programming F. Rossi P. van Beek and T. Walsh (Eds.). Elsevier Chapter 8.  D. Cohen and P. Jeavons. 2006. The complexity of constraint languages. In Handbook of Constraint Programming F. Rossi P. van Beek and T. Walsh (Eds.). Elsevier Chapter 8.","DOI":"10.1016\/S1574-6526(06)80012-X"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.62.062314"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.08.003"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314690.1314691"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<260::AID-RSA5>3.0.CO;2-W"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/100811258"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/090757496"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830600767X"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2450142.2450146"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2006.07.004"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP\u201917) (Leibniz International Proceedings in Informatics (LIPIcs))","author":"Lin Jiabao"},{"key":"e_1_2_1_28_1","volume-title":"Chuang","author":"Nielsen Michael A.","year":"2010"},{"key":"e_1_2_1_29_1","unstructured":"The Sage Developers. 2018. SageMath the Sage Mathematics Software System (Version 8.3). Retrieved from http:\/\/www.sagemath.org.  The Sage Developers. 2018. SageMath the Sage Mathematics Software System (Version 8.3). Retrieved from http:\/\/www.sagemath.org."},{"key":"e_1_2_1_30_1","first-page":"17","article-title":"Approximate counting for complex-weighted Boolean constraint satisfaction problems. Info","volume":"219","author":"Yamakami Tomoyuki","year":"2012","journal-title":"Comput."},{"key":"e_1_2_1_31_1","volume-title":"Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems. Theor. Comput. Sci. 461 (Nov","author":"Yamakami Tomoyuki","year":"2012"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3381425","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3381425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:33:06Z","timestamp":1750185186000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3381425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,9]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4,30]]}},"alternative-id":["10.1145\/3381425"],"URL":"https:\/\/doi.org\/10.1145\/3381425","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,9]]},"assertion":[{"value":"2018-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}