Computational complexity of Holant problems
From MaRDI portal
Recommendations
Cited in
(51)- Complexity classification of the six-vertex model
- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP
- Zero-free regions of partition functions with applications to algorithms and graph limits
- Clifford gates in the Holant framework
- Holographic reduction, interpolation and hardness
- Mixed partition functions and exponentially bounded edge-connection rank
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- Zero-freeness and approximation of real Boolean Holant problems
- Zeros and approximations of holant polynomials on the complex plane
- A structured view on weighted counting with relations to counting, quantum computation and applications
- Counting edge-injective homomorphisms and matchings on restricted graph classes
- A dichotomy for real weighted Holant problems
- A complete dichotomy rises from the capture of vanishing signatures
- From Holant to \#CSP and back: dichotomy for Holant\(^{c }\) problems
- Holant problems for regular graphs with complex edge functions
- 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
- Graph parameters from symplectic group invariants
- A Computational Proof of Complexity of Some Restricted Counting Problems
- The complexity of complex weighted Boolean \#CSP
- The complexity of Boolean Holant problems with nonnegative weights
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Dichotomy for real Holant\(^{\mathrm c}\) problems
- Complexity dichotomy for counting problems
- Holant clones and the approximability of conservative holant problems
- On the Complexity of Holant Problems
- Counting problems in parameterized complexity
- On the counting complexity of mathematical nanosciences
- Zeros of Holant Problems
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
- Tensor network complexity of multilinear maps
- A full dichotomy for \(\mathrm{Holant}^c\), inspired by quantum computation
- A New Holant Dichotomy Inspired by Quantum Computation
- scientific article; zbMATH DE number 7204481 (Why is no real title available?)
- Counting restricted homomorphisms via Möbius inversion over matroid lattices
- Holant problems and counting CSP
- Zeros of Holant problems: locations and algorithms
- A computational proof of complexity of some restricted counting problems
- Dichotomy for Holant* problems of Boolean domain
- Dichotomy for Holant* problems with a function on domain size 3
- Where Tutte and Holant meet: a view from counting complexity
- The complexity of symmetric Boolean parity Holant problems
- The complexity of symmetric Boolean parity Holant problems (extended abstract)
- Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
- Beyond windability: approximability of the four-vertex model
- Spectral independence via stability and applications to Holant-type problems
- On the complexity of generalized chromatic polynomials
- Towards a complexity-theoretic dichotomy for TQFT invariants
- P-time algorithms for typical \#EO problems
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
This page was built for publication: Computational complexity of Holant problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096095)
