Search Results

We study the complexity of approximating the partition function of the q-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters. Apart from the classical connections with quantum computing and ...$$

Log-concave polynomials give rise to discrete probability distributions with several nice properties. In particular, log-concavity of the generating polynomial guarantees the existence of efficient algorithms for approximately sampling from a ...

We give a fully polynomial-time approximation scheme (FPTAS) to count the number of q-colorings for k-uniform hypergraphs with maximum degree Δ if k≥ 28 and q > 315Δ^14/k−14. We also obtain a polynomial-time almost uniform sampler if q>798Δ^16/k−16/3. ...

We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters. Our results are partly motivated by the study of the quantum complexity classes BQP and IQP. Recent results show how to encode quantum ...

Mining techniques of infinite data streams often store synoptic information about the most recently observed

data elements. Motivated by space efficient solutions, our work exploits approximate counting over a fixed-size

sliding window to detect ...

We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Δ. More generally, for an input graph G=V,E and an activity λ>0, we are interested in the quantity ZGλ defined as the sum over ...

Given $n$ elements with non-negative integer weights $w_1,..., w_n$ and an integer capacity $C$, we consider the counting version of the classic knapsack problem: find the number of distinct subsets whose weights add up to at most $C$. We give the first ...