default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Constraint Satisfaction Problem 2017
- Andrei A. Krokhin, Stanislav Zivný:
The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-003-3 - Front Matter, Table of Contents, Preface, List of Authors. i-xii
- Libor Barto, Andrei A. Krokhin, Ross Willard:
Polymorphisms, and How to Use Them. 1-44 - Libor Barto, Marcin Kozik:
Absorption in Universal Algebra and CSP. 45-77 - Manuel Bodirsky
, Marcello Mamino:
Constraint Satisfaction Problems over Numeric Domains. 79-111 - Martin C. Cooper, Stanislav Zivný:
Hybrid Tractable Classes of Constraint Problems. 113-135 - Serge Gaspers, Sebastian Ordyniak, Stefan Szeider:
Backdoor Sets for CSP. 137-157 - Heng Guo, Pinyan Lu:
On the Complexity of Holant Problems. 159-177 - Gregory Z. Gutin, Anders Yeo:
Parameterized Constraint Satisfaction Problems: a Survey. 179-203 - Mark Jerrum:
Counting Constraint Satisfaction Problems. 205-231 - Andrei A. Krokhin, Stanislav Zivný:
The Complexity of Valued CSPs. 233-266 - Benoît Larose:
Algebra and the Complexity of Digraph CSPs: a Survey. 267-285 - Konstantin Makarychev, Yury Makarychev:
Approximation Algorithms for CSPs. 287-325 - Barnaby Martin:
Quantified Constraints in Twenty Seventeen. 327-346
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
