Sciweavers

ECCC
2002
68views more  ECCC 2002»
13 years 11 months ago
Bi-Immunity Separates Strong NP-Completeness Notions
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
Aduri Pavan, Alan L. Selman