Approximability of the complementarily symmetric Holant problems on cubic graphs
From MaRDI portal
Publication:6076358
DOI10.1016/j.tcs.2023.114140OpenAlexW4386071091MaRDI QIDQ6076358
Chihao Zhang, Yuqiao He, Guoliang Qiu
Publication date: 21 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114140
Cites Work
- Unnamed Item
- Zero-freeness and approximation of real Boolean Holant problems
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures
- An Effective Dichotomy for the Counting Constraint Satisfaction Problem
- Holographic Algorithms
- The Complexity of Boolean Holant Problems with Nonnegative Weights
- Canonical Paths for MCMC: from Art to Science
- Complexity Dichotomies for Counting Problems
- Complexity of Counting CSP with Complex Weights
- Zeros of Holant Problems
- Approximability of the eight-vertex model
- Approximability of the Six-vertex Model
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- The complexity of the counting constraint satisfaction problem
- Correlation Decay up to Uniqueness in Spin Systems
- Approximate Counting via Correlation Decay in Spin Systems
This page was built for publication: Approximability of the complementarily symmetric Holant problems on cubic graphs
