非一致约化与NP完全性
Nonuniform Reductions and NP-Completeness
摘要:
非均匀性是计算复杂性的核心概念,与电路复杂性和随机性有着密切的联系。非一致约简已经被用来研究NP的同构猜想和更大复杂性类的完备性。我们研究了NP完全性的非一致约简的幂,得到了NP中非一致完全性与一致完全性的分离和上界。在各种假设下,我们得到了以下分离:1。NP在非一致多-一约化下有一个完备集,但在一致多-一约化下没有完备集。即使有一点点不统一的建议,这也是真的。2. NP在非一致的多-一约简下有一个完备集,但在一致的图灵约简下没有。也就是说,多项式非均匀性比多项式数量的查询更强。3.对于任何固定的多项式p(n),在一致的2-真值表归约下,NP有一个完备的集合,但在使用p(n)建议的非一致的多-一归约下则没有。也就是说,在第二个查询中给出统一约简比使用固定多项式建议的非统一约简更强大。4. NP问题在多项式咨询的非一致多1约简下存在完备集,但在对数咨询的非一致多1约简下不存在完备集。这个层次定理也适用于其他可归约性,如真值表和图灵。我们还考虑了非一致完备性的一致上界。Hirahara(2015)证明了在使用对数建议的非一致真值表约简下,无条件地每个NP完备的集合也是一致图灵完备的。我们表明,在去随机化假设下,真值表约简和真值表完备性的相同陈述也成立。
英文摘要:
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger complexity classes. We study the power of nonuniform reductions for NP-completeness, obtaining both separations and upper bounds for nonuniform completeness vs uniform completeness in NP. Under various hypotheses, we obtain the following separations: 1. There is a set complete for NP under nonuniform many-one reductions, but not under uniform many-one reductions. This is true even with a single bit of nonuniform advice. 2. There is a set complete for NP under nonuniform many-one reductions with polynomial-size advice, but not under uniform Turing reductions. That is, polynomial nonuniformity is stronger than a polynomial number of queries. 3. For any fixed polynomial p(n), there is a set complete for NP under uniform 2-truth-table reductions, but not under nonuniform many-one reductions that use p(n) advice. That is, giving a uniform reduction a second query makes it more powerful than a nonuniform reduction with fixed polynomial advice. 4. There is a set complete for NP under nonuniform many-one reductions with polynomial advice, but not under nonuniform many-one reductions with logarithmic advice. This hierarchy theorem also holds for other reducibilities, such as truth-table and Turing. We also consider uniform upper bounds on nonuniform completeness. Hirahara (2015) showed that unconditionally every set that is complete for NP under nonuniform truth-table reductions that use logarithmic advice is also uniformly Turing-complete. We show that under a derandomization hypothesis, the same statement for truth-table reductions and truth-table completeness also holds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。