以确定性换取时间:k-可达性问题
Trading Determinism for Time: The k-Reach Problem
AI总结:
针对空间受限计算中确定性与时间的权衡问题,提出k-可达性新问题,通过设计依赖与不依赖Savitch的两种算法,展示其在空间与时间上的类似权衡,为该现象提供新见解。
摘要:
Kallampally和Tewari于2016年指出,空间受限计算中确定性与时间之间存在权衡。他们通过设计一种无歧义非确定性算法解决有向图可达性问题,该算法需O(log²n)空间且同时在多项式时间内运行。Savitch 1970年提出的确定性算法解决同一问题时也需O(log²n)空间,但不保证多项式运行时间,因此存在权衡。我们描述了一个新问题,针对该问题我们可以展示确定性与时间之间的类似权衡。我们考虑f条有向路径的集合P。我们证明,在这些路径图的并集G中,通过在P的路径间切换不超过k次的路径来查找两个顶点间可达性的问题,可在O(klog f+log n)空间内解决,但该算法不保证多项式运行时间。另一方面,我们也证明同一问题可通过无歧义非确定性算法解决,该算法同时在O(klog f+log n)空间和多项式时间内运行。由于这两种算法不依赖Savitch,因此该示例为空间受限计算中确定性与时间权衡的发生方式提供了新见解,并使这一现象不再那么难以捉摸。
英文摘要:
Kallampally and Tewari showed in 2016 that there can be a trade-off between determinism and time in space-bounded computations. This they did by describing an unambiguous non-deterministic algorithm to solve Directed Graph Reachability that requires O(log^2 n) space and simultaneously runs in polynomial time. Savitch's 1970 algorithm that solves the same problem deterministically also requires O(log^2 n) space but doesn't guarantee polynomial running time and hence the trade off. We describe a new problem for which we can show a similar trade off between determinism and time. We consider a collection P of f directed paths. We show that the problem of finding reachability from one vertex to another in the union G of these path graphs via a path that switches amongst the paths in P at most k times can be solved in O(klog f+log n) space but the algorithm doesn't guarantee polynomial runtime. On the other hand, we also show that the same problem can be solved by an unambiguous non-deterministic algorithm that simultaneously runs in O(klog f+log n) space and polynomial time. Since these two algorithms are not dependent on Savitch, therefore this example sheds new light on how such a trade off between determinism and time happens in space-bounded computations and makes the phenomenon less elusive.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。