计算图连通概率的指数时间复杂度
The Exponential Time Complexity of Computing the Probability That a Graph is Connected
摘要:
我们证明了,对于任意概率p(0 < p < 1),在指数时间假设下,对于m条边的简单图,计算具有边失效概率p的全终端图可靠性需要时间指数Ω(m/ log^2 m)。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。