The Exponential Time Complexity of Computing the Probability That a Graph is Connected
arXiv:1009.2363 · doi:10.1007/978-3-642-17493-3_19
Abstract
We show that for every probability p with 0 < p < 1, computation of all-terminal graph reliability with edge failure probability p requires time exponential in Omega(m/ log^2 m) for simple graphs of m edges under the Exponential Time Hypothesis.
To appear in 5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13-15, 2010, Chennai, India, Springer LNCS, 2010