Pages that link to "Item:Q1934313"
From MaRDI portal
The following pages link to From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313):
Displaying 18 items.
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Clifford gates in the Holant framework (Q1786604) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- (Q5002678) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- (Q5091171) (← links)
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation (Q5096443) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs (Q5886117) (← links)
- Complexity classification of the eight-vertex model (Q6116195) (← links)
