The following pages link to Holant problems and counting CSP (Q5172769):
Displaying 37 items.
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
- The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
- The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← links)
- A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
- Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (Q690466) (← links)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- On blockwise symmetric matchgate signatures and higher domain \#CSP (Q1633804) (← links)
- Zero-free regions of partition functions with applications to algorithms and graph limits (Q1786055) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
- Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems (Q2254494) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- Progress in Complexity of Counting Problems (Q3004647) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
- Classification of a Class of Counting Problems Using Holographic Reductions (Q5323095) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← links)
- Perfect matchings, rank of connection tensors and graph homomorphisms (Q5886319) (← links)
- The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5918683) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)
- The computational complexity of Holant problems on 3-regular graphs (Q6199389) (← links)
