1 research outputs found
NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets
A long standing open problem in the computational complexity theory is to
separate NE from BPP, which is a subclass of . In this
paper, we show that
Nonexponentially-Dense-Class), where Nonexponentially-Dense-Class is the class
of languages A without exponential density (for each constant c>0, for infinitely many integers n).
Our result implies for every time
constructible super-polynomial function g(n) such as
g(n)=n^{\ceiling{\log\ceiling{\log n}}}, where Pad(NP, g(n)) is class of all
languages for . We also show