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


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