Complexity classification of the six-vertex model
From MaRDI portal
Publication:1706146
DOI10.1016/j.ic.2018.01.003zbMath1388.68107arXiv1702.02863OpenAlexW2962684130MaRDI QIDQ1706146
Zhiguo Fu, Mingji Xia, Jin-Yi Cai
Publication date: 21 March 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.02863
Related Items (4)
Complexity classification of the eight-vertex model ⋮ Unnamed Item ⋮ Beyond windability: approximability of the four-vertex model ⋮ Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS
Cites Work
- Unnamed Item
- Unnamed Item
- A dichotomy for real weighted Holant problems
- The complexity of complex weighted Boolean \#CSP
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- Expressiveness of matchgates.
- On the number of Eulerian orientations of a graph
- Markov Chain Algorithms for Planar Lattice Structures
- Computational Complexity of Holant Problems
- Polynomial-Time Approximation Algorithms for the Ising Model
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Holographic Algorithms
- Approximating the Partition Function of the Ferromagnetic Potts Model
- The computational complexity of two‐state spin systems
- A complete dichotomy rises from the capture of vanishing signatures
- Correlation Decay up to Uniqueness in Spin Systems
This page was built for publication: Complexity classification of the six-vertex model
