Pages that link to "Item:Q879594"

The following pages link to Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594):

Displaying 46 items.

• A dichotomy for real weighted Holant problems (Q260401) (← links)
• The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
• Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
• Testing list \(H\)-homomorphisms (Q347111) (← links)
• Enumerating homomorphisms (Q414933) (← links)
• The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← 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)
• The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
• \(H\)-coloring dichotomy revisited (Q817769) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• A new line of attack on the dichotomy conjecture (Q896081) (← links)
• Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
• An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• Complexity of generalized satisfiability counting problems (Q1917076) (← links)
• Holographic reduction, interpolation and hardness (Q1926111) (← links)
• From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
• The complexity of problems for quantified constraints (Q1959381) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
• A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights (Q2323358) (← links)
• Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
• Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658) (← links)
• The complexity of partition functions (Q2581263) (← links)
• A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
• On algebras with many symmetric operations (Q2821826) (← links)
• An effective dichotomy for the counting constraint satisfaction problem (Q2848220) (← links)
• On the complexity of \#CSP (Q2875200) (← links)
• Counting List Matrix Partitions of Graphs (Q2944567) (← links)
• Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
• The property of being polynomial for Mal’tsev constraint satisfaction problems (Q3546063) (← links)
• A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290) (← links)
• The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
• Counting Constraint Satisfaction Problems. (Q4993601) (← links)
• Consistency for counting quantifiers (Q5005107) (← 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)
• On the Complexity of Reconstructing H-free Graphs from Their Star Systems (Q5458528) (← 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)
• Complexity classification of the eight-vertex model (Q6116195) (← links)
• Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
• A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions (Q6634373) (← links)