In this paper we show a new way of constructing deterministic polynomial-time
approximation algorithms for computing complex-valued evaluations of a large class of …

We develop an efficient algorithmic approach for approximate counting and sampling in the
low-temperature regime of a broad class of statistical physics models on finite subsets of the …

We give a fully polynomial-time approximation scheme (FPTAS) and an efficient sampling
algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander …

Given complex numbers w1,…, wn, we define the weight w (X) of a set X of 0–1 vectors as
the sum of. Applications include counting weighted perfect matchings in hypergraphs …

A fundamental graph problem asks to compute the number of induced copies of a k-node
pattern graph H in an n-node graph G. The fastest algorithm to date is still the 35-years-old …

We show how two techniques from statistical physics can be adapted to solve a variant of
the notorious Unique Games problem, potentially opening new avenues towards the Unique …

Given ak-node pattern graph H and an n-node host graph G, the subgraph counting problem
asks to compute the number of copies of H in G. In this work we address the following …

We resolve the fine-grained parameterized complexity of detecting and counting small
patterns in planar graphs, assuming the Exponential Time Hypothesis. Given an n-vertex …

The problem of (approximately) counting the independent sets of a bipartite graph (# BIS) is
the canonical approximate counting problem that is complete in the intermediate complexity …

We study the problem of counting the isomorphic occurrences of a k-vertex pattern graph P
as a subgraph in an n-vertex host graph G. Our specific interest is on algorithms for …