距离与行列式的催化空间高效算法
Catalytic space-efficient algorithms for Distance and Determinant
AI总结:
该研究将催化计算的亚线性空间边界从可达性扩展至最短距离,还证明了行列式的近线性催化空间与多项式时间边界,并结合相关文献方法实现加权图的亚线性CLP距离算法。
摘要:
催化计算会复用可能很大但正在使用的空间(即催化空间),该空间必须恢复至初始内容,同时清洁空间很小。这使得所有NL类甚至更大类问题都可在催化对数空间内解决[Buhrman等人,STOC2014]。在[Chmel等人,CCC2026]中,可达性的催化空间被限制为亚线性空间(具体为n/2^(θ(√log n))空间),同时保持多项式时间,这与[Barnes等人,SICOMP1998]的非催化边界一致。我们将该可达性边界扩展至最短距离,证明了同时满足亚线性催化空间和多项式时间的边界(以下称为亚线性CLP),这是首次在无催化约束的情况下为距离问题提供同时的亚线性空间与多项式时间边界,且该边界对多项式加权图也适用。在此过程中,我们还证明了行列式的同时近线性催化空间(O(n log^(O(1))n))与多项式时间边界,并给出其在平面匹配问题中的一些应用。我们的研究起点是[Cook-Pyne,ITCS2026]提出的有向图可达性的催化计算;[Edenhofer,arXiv:2602.21088]利用该方法给出了催化空间与非催化空间之间的权衡,而[Chmel等人,CCC2026]则通过压缩图为保留s,t-可达性的更小图来实现更小的空间边界,这三者均可修改为无权距离的算法。我们的贡献是定义了加权图中游走多项式的近似值,该近似值使我们能在亚线性CLP中推断加权s,t-距离,具体通过非平凡地结合上述三篇论文的元素实现。
英文摘要:
Catalytic computation reuses potentially large but in-use space (or catalytic space) which must be restored to its initial contents while the clean space is small. This allows all problems in $\mathsf{NL}$ and even larger classes to be in catalytic logspace [Buhrman et al, STOC2014]. In [Chmel et al, CCC2026] the catalytic space for reachability was restricted to sublinear space (specifically, $n \big/ 2^{θ(\sqrt{\log n})}$ space) while remaining in polynomial time. This matches the non-catalytic bounds from [Barnes et al, SICOMP1998]. We extend the reachability bound to shortest distance, proving a simultaneous sublinear catalytic space and polynomial time bound (henceforth called, sublinear $\mathsf{CLP}$). This is the first simultaneous sublinear space and polynomial time bound for distance even without the catalytic discipline. Moreover, our bound works even for polynomially weighted graphs. Along the way we prove simultaneous near linear catalytic space ($\mathcal{O}(n\log^{O(1)}{n})$) and polynomial time bounds for the determinant. We also show some applications to planar matching problems. Our starting point was catalytic computation of reachability in directed graphs by [Cook-Pyne, ITCS2026]. [Edenhofer, arXiv:2602.21088] used it to give a tradeoff between catalytic and non-catalytic space, while [Chmel et al, CCC2026] compress the graph to a smaller graph preserving $s,t$-reachability to achieve a smaller space bound. All three can be modified to yield an algorithm for unweighted distance. Our contribution is to define an approximation to the walk polynomial in weighted graphs that allows us to infer weighted $s,t$-distance in sublinear $\mathsf{CLP}$. We do so by non-trivially combining elements from each of the above three papers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。