---
_id: '11991'
abstract:
- lang: eng
  text: The study of the complexity of the constraint satisfaction problem (CSP),
    centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in
    the last two decades. After a long concerted effort and many partial results,
    the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and
    Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP,
    has started to gain prominence. In this survey, we explain the importance of promise
    CSP and highlight many new very interesting features that the study of promise
    CSP has brought to light. The complexity classification quest for the promise
    CSP is wide open, and we argue that, despite the promise CSP being more general,
    this quest is rather more accessible to a wide range of researchers than the dichotomy-led
    study of the CSP has been.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Andrei
  full_name: Krokhin, Andrei
  last_name: Krokhin
- first_name: Jakub
  full_name: Opršal, Jakub
  id: ec596741-c539-11ec-b829-c79322a91242
  last_name: Opršal
  orcid: 0000-0003-1245-3456
citation:
  ama: Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem.
    <i>ACM SIGLOG News</i>. 2022;9(3):30-59. doi:<a href="https://doi.org/10.1145/3559736.3559740">10.1145/3559736.3559740</a>
  apa: Krokhin, A., &#38; Opršal, J. (2022). An invitation to the promise constraint
    satisfaction problem. <i>ACM SIGLOG News</i>. Association for Computing Machinery.
    <a href="https://doi.org/10.1145/3559736.3559740">https://doi.org/10.1145/3559736.3559740</a>
  chicago: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint
    Satisfaction Problem.” <i>ACM SIGLOG News</i>. Association for Computing Machinery,
    2022. <a href="https://doi.org/10.1145/3559736.3559740">https://doi.org/10.1145/3559736.3559740</a>.
  ieee: A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction
    problem,” <i>ACM SIGLOG News</i>, vol. 9, no. 3. Association for Computing Machinery,
    pp. 30–59, 2022.
  ista: Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction
    problem. ACM SIGLOG News. 9(3), 30–59.
  mla: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint
    Satisfaction Problem.” <i>ACM SIGLOG News</i>, vol. 9, no. 3, Association for
    Computing Machinery, 2022, pp. 30–59, doi:<a href="https://doi.org/10.1145/3559736.3559740">10.1145/3559736.3559740</a>.
  short: A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
date_created: 2022-08-27T11:23:37Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2022-09-05T08:19:38Z
day: '01'
department:
- _id: UlWa
doi: 10.1145/3559736.3559740
external_id:
  arxiv:
  - '2208.13538'
intvolume: '         9'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/2208.13538
month: '07'
oa: 1
oa_version: Preprint
page: 30-59
publication: ACM SIGLOG News
publication_identifier:
  issn:
  - 2372-3491
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: An invitation to the promise constraint satisfaction problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2022'
...