Pages that link to "Item:Q3546354"
From MaRDI portal
The following pages link to On counting homomorphisms to directed acyclic graphs (Q3546354):
Displayed 27 items.
- A dichotomy for real weighted Holant problems (Q260401) (← 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)
- 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)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- Classical simulation of quantum circuits by half Gauss sums (Q2113488) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights (Q2323358) (← links)
- A dichotomy for bounded degree graph homomorphisms with nonnegative weights (Q2678252) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- (Q5009461) (← links)
- (Q5088963) (← links)
- Classification of a Class of Counting Problems Using Holographic Reductions (Q5323095) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← links)
- The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)