8 research outputs found
Autoreducibility of NP-Complete Sets
We study the polynomial-time autoreducibility of NP-complete sets and obtain
separations under strong hypotheses for NP. Assuming there is a p-generic set
in NP, we show the following:
- For every , there is a -T-complete set for NP that is -T
autoreducible, but is not -tt autoreducible or -T autoreducible.
- For every , there is a -tt-complete set for NP that is -tt
autoreducible, but is not -tt autoreducible or -T autoreducible.
- There is a tt-complete set for NP that is tt-autoreducible, but is not
btt-autoreducible.
Under the stronger assumption that there is a p-generic set in NP
coNP, we show:
- For every , there is a -tt-complete set for NP that is -tt
autoreducible, but is not -T autoreducible.
Our proofs are based on constructions from separating NP-completeness
notions. For example, the construction of a 2-T-complete set for NP that is not
2-tt-complete also separates 2-T-autoreducibility from 2-tt-autoreducibility
Nonuniform Reductions and NP-Completeness
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 NP0completeness, obtaining both separations and upper bounds for nonuniform completeness vs uniform complessness 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 ad- vice, 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
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum