Conference item
Minimal weighted clones with Boolean support
- Abstract:
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 506.4KB, Terms of use)
-
- Publisher copy:
- 10.1109/ISMVL.2016.10
Authors
+ Engineering and Physical Sciences Research Council
More from this funder
- Funding agency for:
- Vaicenavicius, A
- Grant:
- Doctoral Training Award
- Publisher:
- Institute of Electrical and Electronics Engineers
- Host title:
- 46th International Symposium on Multiple-Valued Logic (ISMVL 2016)
- Journal:
- 46th International Symposium on Multiple-Valued Logic (ISMVL 2016) More from this journal
- Publication date:
- 2016-07-01
- Acceptance date:
- 2016-02-01
- DOI:
- Pubs id:
-
pubs:604655
- UUID:
-
uuid:0332147f-ec7a-40ed-b0dd-d782ac31635c
- Local pid:
-
pubs:604655
- Source identifiers:
-
604655
- Deposit date:
-
2016-02-17
- ARK identifier:
Terms of use
- Copyright holder:
- Institute of Electrical and Electronics Engineers
- Copyright date:
- 2016
- Notes:
- © 2016 IEEE. This is the accepted manuscript version of the article. The final version is available online from the Institute of Electrical and Electronics Engineers at: [10.1109/ISMVL.2016.10]
If you are the owner of this record, you can report an update to it here: Report update to this record