Separating NE from some nonuniform nondeterministic complexity classes

摘要

We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE ? R ~(NP)_(n°(1)-T)(TALLY);(2) NE ? R ~(SN)_m; (3) NEXP ? P~(NP)_(nk-T)k for all k≥1; and (4) NE ? P_(btt) (NP ? SPARSE). Result (3) extends a previous result by Mocas to nonuniform reductions. We also investigate how different an NE-hard set is from an NP-set. We show that for any NP subset A of a many-one-hard set H for NE, there exists another NP subset A′ of H such that A′ ? A and A′-A is not of sub-exponential density.