Journal article
Functional clones and expressibility of partition functions
- Abstract:
- We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions f0; 1gk ! R≥0) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice under set inclusion and are closely related to counting Constraint Satisfaction Problems (CSPs). We identify a sublattice of interesting functional clones and investigate the relationships and properties of the functional clones in this sublattice.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 541.0KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.tcs.2017.05.001
Authors
+ Engineering and Physical Sciences Research Council
More from this funder
- Funding agency for:
- Jerrum, M
- Grant:
- EP/N004221/1
+ European Research Council
More from this funder
- Funding agency for:
- Goldberg, L
- Richerby, D
- Grant:
- 334828
- 334828
+ Natural Sciences and Engineering Research Council of Canada
More from this funder
- Funding agency for:
- Bulatov, A
- Jerrum, M
- Grant:
- EP/N004221/1
- Publisher:
- Elsevier
- Journal:
- Theoretical Computer Science More from this journal
- Volume:
- 687
- Pages:
- 11-39
- Publication date:
- 2017-05-11
- Acceptance date:
- 2017-05-01
- DOI:
- ISSN:
-
0304-3975
- Pubs id:
-
pubs:692038
- UUID:
-
uuid:75cde23b-2cf4-41ac-9b90-6d5458ea5d38
- Local pid:
-
pubs:692038
- Source identifiers:
-
692038
- Deposit date:
-
2017-05-01
- ARK identifier:
Terms of use
- Copyright holder:
- © 2017 Elsevier BV All rights reserved
- Copyright date:
- 2017
- Notes:
- This is the author accepted manuscript following peer review version of the article. The final version is available online from Elsevier at: 10.1016/j.tcs.2017.05.001
If you are the owner of this record, you can report an update to it here: Report update to this record