Paper

Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region

2014

Created by Alysson Bolognesi Prado at 2019-03-28 09:49:03.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

3

Andreas Galanis

Daniel Štefankovi?

Venue

1

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC ’14

References

9

The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs

Computational Transition at the Uniqueness Threshold

Almost all regular graphs are hamiltonian

A constructive proof of the general lovász local lemma

Colouring graphs when the number of colours is nearly the maximum degree

Polynomial-Time Approximation Algorithms for the Ising Model