No. Title Author Year
1 The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains Viola, Caterina et al. 2020
2 The Complexity of Promise SAT on Non-Boolean Domains Brandts, Alex et al. 2020
3 Approximate Counting CSP Seen from the Other Side Bulatov, Andrei A. et al. 2019
4 Beyond Boolean Surjective VCSPs Matl, Gregor et al. 2019
5 Sparsification of Binary CSPs Butti, Silvia et al. 2019
6 Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection Hirai, Hiroshi et al. 2018
7 On Singleton Arc Consistency for CSPs Defined by Monotone Patterns Carbonnel, Clément et al. 2018
8 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) Grohe, Martin et al. 2018
9 DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume Krokhin, Andrei et al. 2017
10 Front Matter, Table of Contents, Preface, List of Authors Krokhin, Andrei et al. 2017
11 Hybrid Tractable Classes of Constraint Problems Cooper, Martin C. et al. 2017
12 The Complexity of Boolean Surjective General-Valued CSPs Fulla, Peter et al. 2017
13 The Complexity of Valued CSPs Krokhin, Andrei et al. 2017
14 On Planar Valued CSPs Fulla, Peter et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 14


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI