A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Multiple-Valued Logic and Soft Computing Année : 2022

A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms

Résumé

Constraint satisfaction problems (CSPs) are combinatorial problems with strong ties to universal algebra and clone theory. The recently proved CSP dichotomy theorem states that each finite-domain CSP is either solvable in polynomial time, or that it is NP-complete. However, among the intractable CSPs there is a seemingly large variance in how fast they can be solved by exponential-time algorithms, which cannot be explained by the classical algebraic approach based on polymorphisms. In this contribution we will survey an alternative approach based on partial polymorphisms, which is useful for studying the fine-grained complexity of NP-complete CSPs. Moreover, we will state and discuss some challenging open problems in this research field.
Fichier principal
Vignette du fichier
survey_paper_mvl_revised.pdf (352.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02943018 , version 1 (18-09-2020)

Identifiants

  • HAL Id : hal-02943018 , version 1

Citer

Miguel Couceiro, Lucien Haddad, Victor Lagerkvist. A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms. Journal of Multiple-Valued Logic and Soft Computing, 2022, 38 (1-2), pp.115-136. ⟨hal-02943018⟩
99 Consultations
194 Téléchargements

Partager

Gmail Facebook X LinkedIn More