Constraint satisfaction problems: complexity and algorithms

DOI10.1007/978-3-319-77313-1_1zbMath1504.68151OpenAlexW2793549356MaRDI QIDQ1647670

Andrei A. Bulatov

Publication date: 26 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-77313-1_1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) History of computer science (68-03) Computational aspects of satisfiability (68R07)

Related Items (3)

Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism ⋮ Unnamed Item ⋮ A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties

This page was built for publication: Constraint satisfaction problems: complexity and algorithms