2000 character limit reached
Complexity Classification Of The Six-Vertex Model
Published 9 Feb 2017 in cs.CC and cond-mat.stat-mech | (1702.02863v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.