Conference icon

Conference

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
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1109/ISMVL.2016.10

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
More from this funder
Funding agency for:
Zivny, S
Publisher:
Institute of Electrical and Electronics Engineers Publisher's website
Publication date:
2016-07-05
DOI:
URN:
uuid:0332147f-ec7a-40ed-b0dd-d782ac31635c
Source identifiers:
604655
Local pid:
pubs:604655

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP