Minimal Weighted Clones with Boolean Support
Peter G. Jeavons‚ Andrius Vaicenavičius and Stanislav Živný
We study algebraic structures called weighted clones. These structures characterise the computational complexity of discrete optimisation problems of special form, known as valued constraint satisfaction problems. We identify all minimal weighted clones for every Boolean support clone.