A Complexity Dichotomy For Hypergraph Partition Functions

A complexity classification of spin systems with an external field

scientific article

An approximation trichotomy for Boolean #CSP

Counting 4 × 4 matrix partitions of graphs ⬇️

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity

scientific article published on 14 May 2024

Counting and Sampling H-Colourings

Counting and sampling H-colourings

Faster exponential-time algorithms for approximately counting independent sets

scientific article published in 2021

Fully Online Matching

scientific article published on 22 May 2020

Functional clones and expressibility of partition functions

Inapproximability of the Tutte polynomial

Markov chain comparison

Matrix norms and rapid mixing for spin systems ⬇️

On Counting Homomorphisms to Directed Acyclic Graphs

On counting homomorphisms to directed acyclic graphs

Randomly Sampling Molecules

scientific article (publication date: 2000)

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows

article by Mary Cryan et al published January 2006 in SIAM Journal on Computing

Systematic scan for sampling colorings

article published in 2006

The Complexity of Weighted Boolean #CSP ⬇️

The Relative Complexity of Approximate Counting Problems

The complexity of approximating bounded-degree Boolean #CSP

The complexity of approximating conservative counting CSPs ⬇️

article published in 2015

The complexity of weighted Boolean #CSP with mixed signs

The complexity of weighted and unweighted #CSP

The expressibility of functions on the boolean domain, with applications to counting CSPs