New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
Open Access
- 9 June 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 967-978
Abstract
No abstract availableAll Related Versions
Funding Information
- Quantum Science and Technology - National Science and Technology Major Project (QNMP) (2021ZD0302901)
This publication has 32 references indexed in Scilit:
- Complexity classification of the eight-vertex modelInformation and Computation, 2023
- FKT is Not Universal — A Planar Holant Dichotomy for Symmetric ConstraintsTheory of Computing Systems, 2021
- Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARSInformation and Computation, 2020
- Complexity classification of the six-vertex modelInformation and Computation, 2018
- The complexity of complex weighted Boolean #CSPJournal of Computer and System Sciences, 2014
- The complexity of weighted and unweighted #CSPJournal of Computer and System Sciences, 2012
- The Statistics of Dimers on a Lattice2009
- The computational complexity of two‐state spin systemsRandom Structures & Algorithms, 2003
- Euler and bipartite matroidsJournal of Combinatorial Theory, 1969
- The Structure and Entropy of Ice and of Other Crystals with Some Randomness of Atomic ArrangementJournal of the American Chemical Society, 1935