Complexity Classification Of The Six-Vertex Model
classification
💻 cs.CC
cond-mat.stat-mech
keywords
modelcomplexitydichotomyprovesix-vertexclassificationcomputingcriterion
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.