Restricted Holant dichotomy on domain sizes 3 and 4
From MaRDI portal
Publication:6652438
DOI10.1016/j.tcs.2024.114931MaRDI QIDQ6652438
Jin-Yi Cai, Yin Liu, Austen Z. Fan
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Holant problems for 3-regular graphs with complex edge functions
- Holographic algorithms: from art to science
- On blockwise symmetric matchgate signatures and higher domain \#CSP
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- 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
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Holographic Algorithms
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Edge coloring models and reflection positivity
- Complexity of Counting CSP with Complex Weights
- Holant Clones and the Approximability of Conservative Holant Problems
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation
- Holant problems and counting CSP
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
- Dichotomy for Holant Problems with a Function on Domain Size 3
- The Complexity of Symmetric Boolean Parity Holant Problems
This page was built for publication: Restricted Holant dichotomy on domain sizes 3 and 4
