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


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