A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Minimal Weighted Clones with Boolean Support
2016
2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)
Preserved Fulltext
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.
doi:10.1109/ismvl.2016.10
dblp:conf/ismvl/JeavonsVZ16
fatcat:6vzqh2yauzcrhbczoym5y7ygxu