Zero-freeness and approximation of real Boolean Holant problems
From MaRDI portal
Recommendations
Cites work
- A complete dichotomy for complex-valued \(\textsc{Holant}^c\)
- A complete dichotomy rises from the capture of vanishing signatures (extended abstract)
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A simple FPTAS for counting edge covers
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- An effective dichotomy for the counting constraint satisfaction problem
- Approximating partition functions of the two-state spin system
- Approximating the Permanent
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Characterizing partition functions of the spin model by rank growth
- Characterizing partition functions of the vertex model
- Combinatorics and complexity of partition functions
- Complexity of counting CSP with complex weights
- Computational complexity of Holant problems
- Computing the permanent of (some) complex matrices
- Correlation decay up to uniqueness in spin systems
- Counting independent sets up to the tree threshold
- Counting unbranched subgraphs
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Dichotomy for real Holant\(^{\mathrm c}\) problems
- Fisher Zeros and Correlation Decay in the Ising Model
- FPTAS for weighted Fibonacci gates and its applications
- Holographic Algorithms
- scientific article; zbMATH DE number 1559584 (Why is no real title available?)
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Location of zeros for the partition function of the Ising model on bounded degree graphs
- On counting perfect matchings in general graphs
- On the switch Markov chain for perfect matchings
- Polynomial-Time Approximation Algorithms for the Ising Model
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
- The complexity of approximating bounded-degree Boolean \(\#\)CSP
- The complexity of Boolean Holant problems with nonnegative weights
- The complexity of the counting constraint satisfaction problem
- The relative complexity of approximate counting problems
- Theorems on the Partition Functions of the Heisenberg Ferromagnets
- Zeros of ferromagnetic 2-spin systems
- Zeros of graph-counting polynomials
- Zeros of Holant problems: locations and algorithms
Cited in
(5)- Zeros and approximations of holant polynomials on the complex plane
- Zeros of Holant Problems
- scientific article; zbMATH DE number 7204481 (Why is no real title available?)
- Approximability of the complementarily symmetric Holant problems on cubic graphs
- On the zeros of partition functions with multi-spin interactions
This page was built for publication: Zero-freeness and approximation of real Boolean Holant problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143138)
