%0 Journal Article
%T The Exponential Time Complexity of Computing the Probability That a Graph is Connected
%A Thore Husfeldt
%A Nina Taslaman
%J Computer Science
%D 2010
%I arXiv
%R 10.1007/978-3-642-17493-3_19
%X 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.
%U http://arxiv.org/abs/1009.2363v3