Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …

Recent progress in the development of quantum technologies has enabled the direct
investigation of the dynamics of increasingly complex quantum many-body systems. This …

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 …

We show conditional lower bounds for well-studied# P-hard problems: The number of
satisfying assignments of a 2-CNF formula with n variables cannot be computed in time exp …

Given a graph with n vertices, k terminals and bounded integer weights on the edges, we
compute the minimum Steiner Tree in O^*(2^k) time and polynomial space, where the O …

We revisit Sapozhenko's classic proof on the asymptotics of the number of independent sets
in the discrete hypercube {0, 1} d and Galvin's follow‐up work on weighted independent …

Given a graph with n vertices, k terminals and positive integer weights not larger than c, we
compute a minimum Steiner Tree in O^⋆(2^kc) time and O^⋆(c) space, where the O^⋆ …

Understanding the complexity of approximately counting the number of weighted or
unweighted independent sets in a bipartite graph (# BIS) is a central open problem in the …

We present a detailed probabilistic and structural analysis of the set of weighted
homomorphisms from the discrete torus Z mn, where m is even, to any fixed graph: we show …