Pages that link to "Item:Q3096095"
From MaRDI portal
The following pages link to Computational Complexity of Holant Problems (Q3096095):
Displayed 28 items.
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Graph parameters from symplectic group invariants (Q345132) (← links)
- The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Complexity classification of the six-vertex model (Q1706146) (← links)
- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP (Q1725642) (← links)
- Zero-free regions of partition functions with applications to algorithms and graph limits (Q1786055) (← links)
- Clifford gates in the Holant framework (Q1786604) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- Mixed partition functions and exponentially bounded edge-connection rank (Q2031486) (← links)
- FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- (Q5009461) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
- (Q5090377) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
- Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields (Q6053403) (← links)
- Beyond windability: approximability of the four-vertex model (Q6204549) (← links)