The following pages link to (Q5002678):
Displaying 12 items.
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
- The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation (Q5096443) (← links)
- Perfect matchings, rank of connection tensors and graph homomorphisms (Q5886319) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5918629) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5918683) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5925621) (← links)
