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 RNP no(1)-T (TALLY); (2)NE RSN m (SPARSE); and (3) NE PNP nk-T /nk

• Type: Conference
• Year: 2009
• Where: COCOON
• Authors: Bin Fu, Angsheng Li, Liyu Zhang
• Keywords: COCOON 2009, Combinatorics, NE RNP, Reduction Closures, Tally Sets