两终端网络可靠性的近似
Approximating two-terminal network reliability
首次发表
浏览论文内容
中文总结 AI 辅助
针对一般图的两终端可靠性问题，提出FPRAS，证明互补不可靠性问题#BIS难，核心思想来自GPT-5.6 Sol Ultra。
中文摘要 AI 辅助
我们针对一般图（含有向和无向）的两终端可靠性问题，提出了全多项式时间随机近似方案（FPRAS）；同时证明互补的不可靠性问题是#BIS难问题，该算法核心思想由GPT-5.6 Sol Ultra发现。
英文摘要
We present a fully polynomial-time randomised approximation scheme (FPRAS) for the two-terminal reliability problem on general graphs, both directed and undirected. We also show that the complementary unreliability question is \BIS-hard. The key idea of the algorithm was discovered by GPT-5.6 Sol Ultra.
