Pages that link to "Item:Q4521549"

The following pages link to The complexity of counting graph homomorphisms (Q4521549):

Displaying 50 items.

• 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)
• Holant problems for 3-regular graphs with complex edge functions (Q315538) (← 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 generalized domino tilings (Q396923) (← links)
• The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← links)
• The worm process for the Ising model is rapidly mixing (Q504198) (← links)
• A computational proof of complexity of some restricted counting problems (Q534558) (← links)
• The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
• Distinguishing graphs by their left and right homomorphism profiles (Q648964) (← links)
• On the complexity of generalized chromatic polynomials (Q679542) (← links)
• Computing the partition function for graph homomorphisms (Q681595) (← links)
• A note on a counting problem arising in percolation theory (Q685697) (← 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)
• The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
• List homomorphisms of graphs with bounded degrees (Q864125) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
• Inapproximability of the Tutte polynomial (Q937302) (← links)
• An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
• From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
• An algorithm for the number of path homomorphisms (Q1045039) (← links)
• The complexity of counting homeomorphs (Q1058852) (← links)
• The complexity of restricted graph homomorphisms (Q1356452) (← links)
• Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202) (← links)
• A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\) (Q1417575) (← links)
• Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• The restrictive \(H\)-coloring problem (Q1764813) (← links)
• Zero-free regions of partition functions with applications to algorithms and graph limits (Q1786055) (← links)
• Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
• Counting and sampling \(H\)-colourings (Q1887143) (← links)
• Holographic reduction, interpolation and hardness (Q1926111) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
• Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems (Q2060009) (← links)
• Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
• Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
• Lee-Yang theorems and the complexity of computing averages (Q2249768) (← links)
• The Exponential Time complexity of counting (quantum) graph homomorphisms (Q2301557) (← links)
• \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
• A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights (Q2323358) (← links)
• Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← links)
• The complexity of partition functions (Q2581263) (← links)
• A dichotomy for bounded degree graph homomorphisms with nonnegative weights (Q2678252) (← links)
• The complexity of counting in sparse, regular, and planar graphs (Q2784460) (← links)
• Homomorphism polynomials complete for VP (Q2808529) (← links)