有效的猜测具有不太可能的后果
Effective Guessing Has Unlikely Consequences
AI总结:
本文通过证明有效的非确定性猜测策略会带来不太可能的后果,揭示了其在加速确定性计算上的局限性,表明次多项式猜测实现多项式加速或对数加速将分别导致P严格包含于NTIME(n)及SAT属于NTIME(n)。
摘要:
Paul、Pippenger、Szemerédi和Trotter的一个经典结果表明,DTIME(n)严格包含于NTIME(n)中。由此产生了一个自然问题:对于某个超线性时间可构造函数t(n),DTIME(t(n))是否可能包含于NTIME(n)中?如果这样的函数t(n)确实存在,那么也存在有效的非确定性猜测策略来加速确定性计算。在这项工作中,我们通过证明有效的非确定性猜测策略的存在将带来不太可能的后果,展示了非确定性猜测在加速确定性计算方面的有效性限制。具体而言,我们证明如果次多项式量的非确定性猜测能用于将确定性计算加速多项式倍,那么P严格包含于NTIME(n)中。此外,即使以使每一步都变为非确定性为代价实现对数加速,也将表明在适当编码下SAT属于NTIME(n)。具有可能独立意义的是,在此类编码下,我们还证明SAT可以在非确定性多带图灵机上以O(n lg n)步判定,改进了众所周知的O(n(lg n)^c)界限,其中c为某个常数但未确定的指数,且至少为1。
英文摘要:
A classic result of Paul, Pippenger, Szemerédi and Trotter states that DTIME(n) is strictly contained in NTIME(n). The natural question then arises: could DTIME(t(n)) be contained in NTIME(n) for some superlinear time-constructible function t(n)? If such a function t(n) does exist, then there also exist effective nondeterministic guessing strategies to speed up deterministic computations. In this work, we prove limitations on the effectiveness of nondeterministic guessing to speed up deterministic computations by showing that the existence of effective nondeterministic guessing strategies would have unlikely consequences. In particular, we show that if a subpolynomial amount of nondeterministic guessing could be used to speed up deterministic computation by a polynomial factor, then P is strictly contained in NTIME(n). Furthermore, even achieving a logarithmic speedup at the cost of making every step nondeterministic would show that SAT is in NTIME(n) under appropriate encodings. Of possibly independent interest, under such encodings we also show that SAT can be decided in O(n lg n) steps on a nondeterministic multitape Turing machine, improving on the well-known O(n(lg n)^c) bound for some constant but undetermined exponent c which is at least 1.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。