Journal article icon

Journal article

The complexity of Boolean surjective general-valued CSPs

Abstract:

Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a (Q ∪ {∞})-valued objective function given as a sum of fixed-arity functions. In Boolean surjective VCSPs, variables take on labels from D = {0, 1} and an optimal assignment is required to use both labels from D. Examples include the classical global Min-Cut problem in graphs and the Minimum Distance problem studied in coding theory. We establish a dichotomy theorem and thus give a complete complexity cla...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1145/3282429

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
ORCID:
0000-0002-0263-159X
More from this funder
Funding agency for:
Fulla, P
More from this funder
Funding agency for:
Zivny, S
Publisher:
Association for Computing Machinery Publisher's website
Journal:
ACM Transactions on Computation Theory Journal website
Volume:
11
Issue:
1
Publication date:
2018-11-01
Acceptance date:
2018-09-08
DOI:
EISSN:
1942-3462
ISSN:
1942-3454
Pubs id:
pubs:915988
URN:
uri:807f7d33-3488-438e-a571-bb2c7bd38b3c
UUID:
uuid:807f7d33-3488-438e-a571-bb2c7bd38b3c
Local pid:
pubs:915988

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