2000 character limit reached
The Exponential Time Complexity of Computing the Probability That a Graph is Connected (1009.2363v3)
Published 13 Sep 2010 in cs.CC
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/ log2 m) for simple graphs of m edges under the Exponential Time Hypothesis.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.