Pages that link to "Item:Q5741802"
From MaRDI portal
The following pages link to Dichotomy for Holant Problems with a Function on Domain Size 3 (Q5741802):
Displaying 11 items.
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
- Restricted Holant dichotomy on domains 3 and 4 (Q6606220) (← links)
- Restricted Holant dichotomy on domain sizes 3 and 4 (Q6652438) (← links)
