{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T21:13:44Z","timestamp":1772313224154,"version":"3.50.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005347","name":"Isaac Newton Institute for Mathematical Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2013,10]]},"abstract":"<jats:p>An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base relations. Post's lattice gives a complete classification of all Boolean relational clones, and this has been used to classify the computational difficulty of CSPs. Motivated by a desire to understand the computational complexity of (weighted) counting CSPs, we develop an analogous notion of functional clones and study the landscape of these clones. One of these clones is the collection of log-supermodular (lsm) functions, which turns out to play a significant role in classifying counting CSPs. In the conservative case (where all nonnegative unary functions are available), we show that there are no functional clones lying strictly between the clone of lsm functions and the total clone (containing all functions). Thus, any counting CSP that contains a single nontrivial non-lsm function is computationally as hard to approximate as any problem in #P. Furthermore, we show that any nontrivial functional clone (in a sense that will be made precise) contains the binary function \u201cimplies\u201d. As a consequence, in the conservative case, all nontrivial counting CSPs are as hard to approximate as #BIS, the problem of counting independent sets in a bipartite graph. Given the complexity-theoretic results, it is natural to ask whether the \u201cimplies\u201d clone is equivalent to the clone of lsm functions. We use the M\u00f6bius transform and the Fourier transform to show that these clones coincide precisely up to arity 3. It is an intriguing open question whether the lsm clone is finitely generated. Finally, we investigate functional clones in which only restricted classes of unary functions are available.<\/jats:p>","DOI":"10.1145\/2528401","type":"journal-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T15:29:17Z","timestamp":1382542157000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["The expressibility of functions on the boolean domain, with applications to counting CSPs"],"prefix":"10.1145","volume":"60","author":[{"given":"Andrei A.","family":"Bulatov","sequence":"first","affiliation":[{"name":"Simon Fraser University, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[{"name":"University of Leeds, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leslie Ann","family":"Goldberg","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[{"name":"Queen Mary, University of London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Mcquillan","sequence":"additional","affiliation":[{"name":"University of Liverpool, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00536201"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90035-6"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/970831.970840"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.06.003"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"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.1016\/j.jcss.2011.12.002"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 302--313","author":"Bulatov A. A."},{"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","unstructured":"Cai J.-Y. Chen X. and Lu P. 2010. Non-negative Weighted &num;CSPs: An effective complexity dichotomy. CoRR abs\/1012.5659.  Cai J.-Y. Chen X. and Lu P. 2010. Non-negative Weighted &num;CSPs: An effective complexity dichotomy. CoRR abs\/1012.5659."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. 1714--1728","author":"Cai J.-Y."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.02.029"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2078162.2078177"},{"key":"e_1_2_1_14_1","volume-title":"Handbook of Constraint Programming. Foundations of Artificial Intelligence","volume":"2","author":"Cohen D."},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Creignou N. Khanna S. and Sudan M. 2001. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Philadelphia PA.   Creignou N. Khanna S. and Sudan M. 2001. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Philadelphia PA.","DOI":"10.1137\/1.9780898718546"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.02.005"},{"key":"e_1_2_1_17_1","volume-title":"A Brief Introduction to Fourier Analysis on the Boolean Cube. Number 1 in Graduate Surveys","author":"de Wolf R."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1073-y"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/070690201"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.08.003"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830600767X"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2371656.2371660"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.04.005"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.2.157.12225"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222066"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/11534.11537"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(82)80003-0"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095177"},{"key":"e_1_2_1_29_1","unstructured":"Mcquillan C. 2011. LSM is not generated by binary functions. CoRR abs\/1110.0461.  Mcquillan C. 2011. LSM is not generated by binary functions. CoRR abs\/1110.0461."},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Mitzenmacher M. and Upfal E. 2005. Probability and Computing. Cambridge University Press Cambridge UK.  Mitzenmacher M. and Upfal E. 2005. Probability and Computing. Cambridge University Press Cambridge UK.","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.2.305"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1987210201751"},{"key":"e_1_2_1_33_1","volume-title":"Complexity Theory","author":"Wegener I."},{"key":"e_1_2_1_34_1","unstructured":"Yamakami T. 2010. Approximate counting for complex-weighted boolean constraint satisfaction problems. CoRR abs\/1007.0391.   Yamakami T. 2010. Approximate counting for complex-weighted boolean constraint satisfaction problems. CoRR abs\/1007.0391."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-009-9078-z"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.07.001"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2528401","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2528401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:44Z","timestamp":1750231724000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2528401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["10.1145\/2528401"],"URL":"https:\/\/doi.org\/10.1145\/2528401","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]},"assertion":[{"value":"2012-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-10-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}