Zeros of Holant problems: locations and algorithms
From MaRDI portal
Publication:5236324
DOI10.1137/1.9781611975482.137zbMath1432.68573OpenAlexW4213031858MaRDI QIDQ5236324
Heng Guo, Pinyan Lu, Chihao Zhang, Chao Liao
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975482.137
Graph polynomials (05C31) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
The complexity of approximating the complex-valued Potts model ⋮ Zero-freeness and approximation of real Boolean Holant problems ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle ⋮ Parameterized counting of partially injective homomorphisms ⋮ The complexity of approximating the complex-valued Potts model ⋮ The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs ⋮ Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
This page was built for publication: Zeros of Holant problems: locations and algorithms
