David Richerby (Selection)

Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

23		Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby: The complexity of approximating conservative counting CSPs CoRR abs/1208.1783: (2012)
22		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby: The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78(2): 681-688 (2012)
21		Martin E. Dyer, David Richerby: The #CSP Dichotomy is Decidable. STACS 2011: 261-272
18		Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS 2010: 323-334
17		Martin E. Dyer, David Richerby: On the complexity of #CSP. STOC 2010: 725-734
16		Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) CoRR abs/1001.4987: (2010)
15		Martin E. Dyer, David Richerby: The Complexity of #CSP CoRR abs/1003.3879: (2010)
14		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby: The complexity of weighted and unweighted #CSP CoRR abs/1005.2678: (2010)
13		Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR abs/0907.2663: (2009)
10		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410(38-40): 3949-3961 (2009)
7		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Weighted Boolean #CSP with Mixed Signs CoRR abs/0812.4171: (2008)

Selection of 11 from 25 records - David Richerby has 15 coauthors

Last update 2012-09-10 CET by the DBLP Team — Content released under the ODC-BY 1.0 license — See also our legal information page