The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910335668060160 |
|---|---|
| author | Asimi, Kristina Barto, Libor Dalmau, Victor |
| author_facet | Asimi, Kristina Barto, Libor Dalmau, Victor |
| contents | We introduce the framework of the left-hand side restricted promise constraint satisfaction problem, which includes problems like approximating clique number of a graph. We study the parameterized complexity of problems in this class and provide some initial results. The main technical contribution is a sufficient condition for W[1]-hardness which, in particular, covers left-hand side restricted bounded arity CSPs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_06821 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side Asimi, Kristina Barto, Libor Dalmau, Victor Computational Complexity We introduce the framework of the left-hand side restricted promise constraint satisfaction problem, which includes problems like approximating clique number of a graph. We study the parameterized complexity of problems in this class and provide some initial results. The main technical contribution is a sufficient condition for W[1]-hardness which, in particular, covers left-hand side restricted bounded arity CSPs. |
| title | The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2402.06821 |