Pages that link to "Item:Q2382289"
From MaRDI portal
The following pages link to Computational complexity of counting problems on 3-regular planar graphs (Q2382289):
Displaying 24 items.
- 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)
- Holographic algorithms: from art to science (Q619900) (← links)
- Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
- Tensor network contractions for \#SAT (Q887094) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- Satisfaction and power in unanimous majority influence decision models (Q1792097) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- A fixed-parameter perspective on \#BIS (Q2272593) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- A Graph Polynomial for Independent Sets of Bipartite Graphs (Q2911069) (← links)
- Complexity of Ising Polynomials (Q2911072) (← links)
- Counting Homomorphisms to Square-Free Graphs, Modulo 2 (Q3448822) (← links)
- (Q5009461) (← links)
- (Q5088963) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
- (Q5111872) (← links)
- Holographic algorithms on domains of general size (Q6109063) (← links)
