On the complex zeros and the computational complexity of approximating the reliability polynomial

MaRDI QIDQ7208067arXivFDO

Authors Ferenc Bencs, Chiara Piombi, Guus Regts

Publication date 2026

Published in arXiv

Mathematics Subject Classification ID

Approximation algorithms (68W25) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

arXiv classification

math.CO

This page was built for publication: On the complex zeros and the computational complexity of approximating the reliability polynomial

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