空间有限计算中时间的交换决定论
Trading Determinism for Time in Space Bounded Computations
摘要:
Savitch在$1970$中表明,非确定性对数空间(NL)包含在确定性$\mathcal{O}(\log^2 n)$空间中,但他的算法需要准多项式时间。问题是,我们是否可以有一个确定性的算法,每一个问题,在NL,需要多对数空间,同时运行在多项式时间是开放的。在本文中,我们给这个问题的部分解决方案,并表明,对于每一种语言在NL存在一个明确的不确定性算法,需要$\mathcal{O}(\log^2 n)$空间,同时运行在多项式时间。
英文摘要:
Savitch showed in $1970$ that nondeterministic logspace (NL) is contained in deterministic $\mathcal{O}(\log^2 n)$ space but his algorithm requires quasipolynomial time. The question whether we can have a deterministic algorithm for every problem in NL that requires polylogarithmic space and simultaneously runs in polynomial time was left open. In this paper we give a partial solution to this problem and show that for every language in NL there exists an unambiguous nondeterministic algorithm that requires $\mathcal{O}(\log^2 n)$ space and simultaneously runs in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。