Pages that link to "Item:Q2848220"
From MaRDI portal
The following pages link to An Effective Dichotomy for the Counting Constraint Satisfaction Problem (Q2848220):
Displaying 32 items.
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems (Q2060009) (← links)
- The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS (Q2216112) (← links)
- A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights (Q2323358) (← links)
- THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (Q2795309) (← links)
- Counting List Matrix Partitions of Graphs (Q2944567) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
- (Q4625700) (← links)
- (Q4993594) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)
- (Q5009461) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
- (Q5092423) (← links)
- Approximability of the eight-vertex model (Q5092451) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← 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)
- Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)
- Approximability of the complementarily symmetric Holant problems on cubic graphs (Q6076358) (← links)
- Complexity classification of the eight-vertex model (Q6116195) (← links)
- The computational complexity of Holant problems on 3-regular graphs (Q6199389) (← links)
