EUVIMEDEUVIMED entdecken
Crossref

A Proof of the CSP Dichotomy Conjecture

Dmitriy Zhuk

Journal of the ACM · 31.10.2020 · 67 (5) · 1-78

DOI: 10.1145/3402029 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of the ACM, online erschienen am 26.08.2020. Verfasst von Dmitriy Zhuk. Die Arbeit wurde bisher 130-mal zitiert (Crossref) und nennt 65 Literaturangaben. Gefördert von: Russian Foundation for Basic Research, European Research Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The main problem is to classify those subclasses that are solvable in polynomial time and those that are NP-complete. It was conjectured that if a constraint language has a weak near-unanimity polymorphism then the corresponding constraint satisfaction problem is tractable; otherwise, it is NP-complete. In the article, we present an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture. 1

Förderung

  • Russian Foundation for Basic Research
  • European Research Council

Zitieren

APA

Zhuk, D. (2020). A Proof of the CSP Dichotomy Conjecture. Journal of the ACM, 67(5), 1-78. https://doi.org/10.1145/3402029

Vancouver

Zhuk D. A Proof of the CSP Dichotomy Conjecture. Journal of the ACM. 2020;67(5):1-78. doi:10.1145/3402029

BibTeX
@article{Zhuk2020,
  author = {Zhuk, Dmitriy},
  title = {A Proof of the CSP Dichotomy Conjecture},
  journal = {Journal of the ACM},
  year = {2020},
  volume = {67},
  number = {5},
  pages = {1--78},
  doi = {10.1145/3402029}
}
Kostenlos starten →