Holant problems for regular graphs with complex edge functions
From MaRDI portal
Recommendations
- Holant problems for 3-regular graphs with complex edge functions
- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
- Computational complexity of Holant problems
- Dichotomy result on 3-regular bipartite non-negative functions
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions
Cited in
(19)- Holomorphic fiberings of pseudoconcave graphs.
- Holographic reduction, interpolation and hardness
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
- A dichotomy for real weighted Holant problems
- A complete dichotomy rises from the capture of vanishing signatures
- Gadgets and anti-gadgets leading to a complexity dichotomy
- Spin systems on graphs with complex edge functions and specified degree regularities
- 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
- On the Nullstellensatz for c-holomorphic functions with algebraic graphs
- A Computational Proof of Complexity of Some Restricted Counting Problems
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions
- On the Complexity of Holant Problems
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- Where Tutte and Holant meet: a view from counting complexity
- The complexity of symmetric Boolean parity Holant problems (extended abstract)
- Bipartite 3-regular counting problems with mixed signs
- Dichotomy result on 3-regular bipartite non-negative functions
- Spin systems on k-regular graphs with complex edge functions
This page was built for publication: Holant problems for regular graphs with complex edge functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113777)
