May 13, 2013 · Abstract:A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, ...

For k-colorings we prove that for even k, in a tree nonuniqueness region (which corresponds to k < Δ) there is no FPRAS, unless NP = RP, to approximate the ...

A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational ...

ABSTRACT. A remarkable connection has been established for antiferro- magnetic 2-spin systems, including the Ising and hard-core.

In “non-uniqueness", multiple dominant phases which satisfy α 6= β. Examples (in non-uniqueness): Hard-core model → 2 dominant phases,. Antiferro Potts/ ...

Abstract. A remarkable connection has been established for 2-spin systems, including the Ising and hard-core models, showing that the computational ...

We aim to establish the analog of this inapproximability results for the colorings problem, namely, NP-hardness in the tree nonuniqueness region. Our techniques ...

The first analog of the above inapproximability results for multi-spin systems is presented, and it is proved that for even k, in the tree non-uniqueness ...

Abstract: A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the ...

May 13, 2013 · We prove that, unless NP = RP, for any antiferromagnetic spin system, there is no FPRAS for the partition function of ∆-regular graphs when the ...