Pages that link to "Item:Q315538"
From MaRDI portal
The following pages link to Holant problems for 3-regular graphs with complex edge functions (Q315538):
Displaying 12 items.
- A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870) (← links)
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation (Q5096443) (← links)
- The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← links)
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs (Q5886117) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5918629) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5925621) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)
- Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)
- Restricted Holant dichotomy on domains 3 and 4 (Q6606220) (← links)
- Restricted Holant dichotomy on domain sizes 3 and 4 (Q6652438) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)
