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
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 485.7KB)
-
- Publisher copy:
- 10.1145/3282429
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Bibliographic Details
- 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
- Source identifiers:
-
915988
Item Description
- Pubs id:
-
pubs:915988
- UUID:
-
uuid:807f7d33-3488-438e-a571-bb2c7bd38b3c
- Local pid:
- pubs:915988
- Deposit date:
- 2018-09-09
Terms of use
- Copyright holder:
- Association for Computing Machinery
- Copyright date:
- 2018
- Notes:
- © 2018 Association for Computing Machinery. This is the accepted manuscript version of the article. The final version is available online from ACM Transactions on Computation Theory at: 10.1145/3282429
If you are the owner of this record, you can report an update to it here: Report update to this record