The Exponential Time Complexity of Computing the Probability That a Graph is Connected
Thore Husfeldt, Nina Taslaman · IT University Of Copenhagen (IT University of Copenhagen) · 2010
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.