No. Title Author Year
1 A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights Govorov, Artem et al. 2020
2 Discordant Voting Processes on Finite Graphs Cooper, Colin et al. 2016
3 The complexity of approximating conservative counting CSPs Chen, Xi et al. 2013
4 Log-supermodular functions, functional clones and counting CSPs Bulatov, Andrei A. et al. 2012
5 Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241) Dyer, Martin et al. 2011
6 The #CSP Dichotomy is Decidable Dyer, Martin et al. 2011
7 The Complexity of Approximating Bounded-Degree Boolean #CSP Dyer, Martin et al. 2010
8 08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms Dyer, Martin E. et al. 2008
9 05201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms Dyer, Martin et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 9


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