Zeros of Holant Problems

DOI10.1145/3418056MaRDI QIDQ5028341zbMATH OpenOpenAlexFDO

Authors Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang

Publication date 8 February 2022

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.09129

zbMATH Keywords

approximate countingholographic algorithmsHolant problemzero-free region

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph polynomials (05C31) Approximation algorithms (68W25)

Recommendations

• Zeros of Holant problems: locations and algorithms
• Zeros and approximations of holant polynomials on the complex plane
• Zero-freeness and approximation of real Boolean Holant problems
• Computational complexity of Holant problems
• Holant problems and counting CSP

Cited in

(3)

• Zeros and approximations of holant polynomials on the complex plane
• H/sub 2/-optimal zeros
• Approximability of the complementarily symmetric Holant problems on cubic graphs

This page was built for publication: Zeros of Holant Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028341)