#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2003

2018

- This year (2)
- Last 5 years (16)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
- Encyclopedia of Algorithms
- 2016

- Martin E. Dyer, David Richerby
- SIAM J. Comput.
- 2010

Bulatov (2008) gave a dichotomy for the counting constraint satisfaction problem #CSP. A problem from #CSP is characterised by a constraint language, which is a fixed, finite set of relations over a… (More)

- Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
- Inf. Comput.
- 2012

The degree of a CSP instance is the maximum number of times that any variable appears in the scopes of constraints. We consider the approximate counting problem for Boolean CSP with bounded-degree… (More)

- Martin E. Dyer, David Richerby
- STOC
- 2010

Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem, #CSP. A problem from #CSP is characterized by a constraint language γ, which is a fixed, finite set of relations… (More)

- Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
- J. Comput. Syst. Sci.
- 2012

We give some reductions among problems in (nonnegative) weighted #CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our reductions can be… (More)

- Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
- Theor. Comput. Sci.
- 2008

We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued… (More)

We define helicopter cop and robber games with multiple robbers, extending previous research, which only considered the pursuit of a single robber. Our model is defined for robbers that are visible… (More)

- Xiao Dong Chen, Martin E. Dyer, +4 authors David Richerby
- J. Comput. Syst. Sci.
- 2015

We study the complexity of the approximate weighted counting constraint satisfaction problem #CSP ( F ) . In the conservative case, where F contains all unary functions, a classification is known… (More)

- Anuj Dawar, David Richerby, Benjamin Rossman
- Ann. Pure Appl. Logic
- 2008

Abstract We consider Choiceless Polynomial Time ( C PT ), a language introduced by Blass, Gurevich and Shelah, and show that it can express a query originally constructed by Cai, Furer and Immerman… (More)

- Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, María Andrea Arias Serna, Paul G. Spirakis
- Proceedings of the Royal Society A: Mathematical…
- 2013

The Moran process models the spread of genetic mutations through populations. A mutant with relative fitness r is introduced and the system evolves, either reaching fixation (an all-mutant… (More)