MST
2010
13 years 3 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
ECCC
2002
13 years 4 months ago
2002
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...