Complexity classification of the eight-vertex model
From MaRDI portal
Publication:6116195
DOI10.1016/j.ic.2023.105064arXiv1702.07938MaRDI QIDQ6116195
Publication date: 17 July 2023
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.07938
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dichotomy for real weighted Holant problems
- The complexity of complex weighted Boolean \#CSP
- The complexity of weighted and unweighted \(\#\)CSP
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- Complexity classification of the six-vertex model
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS
- The complexity of partition functions
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures
- An Effective Dichotomy for the Counting Constraint Satisfaction Problem
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
- Holographic Algorithms
- The Complexity of Boolean Holant Problems with Nonnegative Weights
- Complexity of Counting CSP with Complex Weights
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation
- A New Holant Dichotomy Inspired by Quantum Computation
- A Complexity Dichotomy for Partition Functions with Mixed Signs
- The complexity of the counting constraint satisfaction problem
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem
