Paper Info
Title
Functional clones and expressibility of partition functions.
Abstract
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions {0,1}k→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.
Year
DOI
Venue
2017
10.1016/j.tcs.2017.05.001
Theoretical Computer Science
Keywords
DocType
Volume
Functional clones,Expressibility,Partition functions,Constraint satisfaction problems
Journal
687
ISSN
Citations 
PageRank 
0304-3975
1
0.35
References 
Authors
9
5
Name
Order
Citations
PageRank
Andrei A. Bulatov1136370.80
leslie ann goldberg21411125.20
mark jerrum32755564.62
David M. Richerby414214.06
Stanislav Živny522828.48