关于线性时间约简的结构
On the structure of linear-time reducibility
摘要:
1975年,Ladner指出,在P不等于NP的假设下,存在一种既不属于P,也不属于NP完全的语言。这个结果后来被Schoning和几位作者推广到各种多项式时间复杂度类。我们在这里表明,这样的结果也适用于线性时间减少RAM(分别。图灵机),并因此允许分离的结果,在线性时间类类似于Ladner的多项式时间。
英文摘要:
In 1975, Ladner showed that under the hypothesis that P is not equal to NP, there exists a language which is neither in P, nor NP-complete. This result was latter generalized by Schoning and several authors to various polynomial-time complexity classes. We show here that such results also apply to linear-time reductions on RAMs (resp. Turing machines), and hence allow for separation results in linear-time classes similar to Ladner's ones for polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。