Conference item
The complexity of promise SAT on non-Boolean domains
- Alternative title:
- Conference paper
- Abstract:
-
While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and Håstad [FOCS'14/SICOMP'17] proved a result known as "(2+ε)-SAT is NP-hard". They showed that the problem of distinguishing k-CNF formulas that are g-satisfiable (i.e. some assignment satisfies at least g literals in every clause) from those that are not even 1-satisfiable is NP-hard if g/k < 1/2 and is in P otherwise. We study a generalisation of SAT on arbitrary finite domains, with clauses that are disjunc...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Reviewed (other)
Actions
Access Document
- Files:
-
-
(Version of record, 541.6KB)
-
- Publisher copy:
- 10.4230/LIPIcs.ICALP.2020.17
- Publication website:
- https://drops.dagstuhl.de/opus/volltexte/2020/12424/
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:
- Schloss Dagstuhl - Leibniz-Zentrum für Informatik Publisher's website
- Journal:
- Leibniz International Proceedings in Informatics Journal website
- Volume:
- 168
- Article number:
- 17
- Publication date:
- 2020-06-29
- Acceptance date:
- 2020-04-15
- Event title:
- ICALP
- Event location:
- Saarbrücken, Germany
- Event website:
- https://icalp2020.saarland-informatics-campus.de/
- Event start date:
- 2020-07-08T00:00:00Z
- Event end date:
- 2020-07-11T00:00:00Z
- DOI:
- ISSN:
-
1868-8969
- ISBN:
- 9783959771382
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
1100413
- Local pid:
- pubs:1100413
- Deposit date:
- 2020-04-16
Terms of use
- Copyright holder:
- Alex Brandts, Marcin Wrochna, and Stanislav Živný
- Copyright date:
- 2020
- Rights statement:
- © Alex Brandts, Marcin Wrochna, and Stanislav Živný; licensed under Creative Commons License CC-BY.
- Notes:
- This conference paper was presented at the 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), July 8-11, Saarbrücken, Germany.
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record