Complexity Classification Of The Six-Vertex Model
Computational Complexity
2017-03-31 v1 Statistical Mechanics
Abstract
We prove a complexity dichotomy theorem for the six-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or #P-hard. The dichotomy criterion is explicit.
Keywords
Cite
@article{arxiv.1702.02863,
title = {Complexity Classification Of The Six-Vertex Model},
author = {Jin-Yi Cai and Zhiguo Fu and Mingji Xia},
journal= {arXiv preprint arXiv:1702.02863},
year = {2017}
}