Holant Problems for Regular Graphs with Complex Edge Functions
From MaRDI portal
Publication:3113777
DOI10.4230/LIPIcs.STACS.2010.2482zbMath1250.68129OpenAlexW2568097732MaRDI QIDQ3113777
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_2f8e.html
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Holant problems for 3-regular graphs with complex edge functions ⋮ Holographic reduction, interpolation and hardness ⋮ Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions ⋮ From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems ⋮ On the Complexity of Holant Problems ⋮ Spin systems on \(k\)-regular graphs with complex edge functions ⋮ Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP ⋮ The complexity of planar Boolean \#CSP with complex weights ⋮ The Complexity of Symmetric Boolean Parity Holant Problems ⋮ Bipartite 3-regular counting problems with mixed signs ⋮ A Complete Dichotomy Rises from the Capture of Vanishing Signatures ⋮ A dichotomy for real weighted Holant problems
