COMPLETENESS FOR NONDETERMINISTIC COMPLEXITY CLASSES

We demonstrate differences between reducibilities and corresponding completeness notions for nondeterministic time and space classes. For time classes the studied completeness notions under polynomial-time bounded (even logarithmic-space bounded) reducibilities turn out to be different for any class containing NE. For space classes the completeness notions under logspace reducibilities can be separated for any class properly containing LOGSPACE. Key observation in obtaining the separations is the honesty property of reductions, which was recently observed to hold for the time classes and can be shown to hold for space classes.