Zeros and approximations of holant polynomials on the complex plane
From MaRDI portal
Publication:2169310
DOI10.1007/s00037-022-00226-5OpenAlexW2943931387WikidataQ114231711 ScholiaQ114231711MaRDI QIDQ2169310
Andreas Göbel, Tobias Friedrich, Katrin Casel, Philipp Fischbeck, J. A. Gregor Lagodzinski
Publication date: 2 September 2022
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03194
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the permanent of (some) complex matrices
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
- Combinatorics and complexity of partition functions
- On the roots of edge cover polynomials of graphs
- Cluster expansion for abstract polymer models
- Random generation of combinatorial structures from a uniform distribution
- Approximate counting, uniform generation and rapidly mixing Markov chains
- The Ising partition function: zeros and deterministic approximation
- Zero-free regions of partition functions with applications to algorithms and graph limits
- The relative complexity of approximate counting problems
- On a conjecture of Sokal concerning roots of the independence polynomial
- Computing permanents of complex diagonally dominant matrices and tensors
- Theory of monomer-dimer systems
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures
- Improved inapproximability results for counting independent sets in the hard-core model
- FPTAS for Counting Weighted Edge Covers
- Counting independent sets up to the tree threshold
- Computational Complexity of Holant Problems
- Polynomial-Time Approximation Algorithms for the Ising Model
- Approximating the Permanent
- Algorithms for #BIS-Hard Problems on Expander Graphs
- Holographic Algorithms
- Canonical Paths for MCMC: from Art to Science
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Left and right convergence of graphs with bounded degree
- The Complexity of Approximating the Matching Polynomial in the Complex Plane
- Counting independent sets in unbalanced bipartite graphs
- FPTAS for Weighted Fibonacci Gates and Its Applications
- Algorithmic Pirogov-Sinai theory
- Weighted counting of solutions to sparse systems of equations
- Approximability of the Six-vertex Model
- Zeros of Holant problems: locations and algorithms
- Statistical Mechanics of Lattice Systems
- Dichotomy for Holant Problems with a Function on Domain Size 3
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
- Fast algorithms at low temperatures via Markov chains†
This page was built for publication: Zeros and approximations of holant polynomials on the complex plane
