Are there any decision complexity classes, where the -Hard version of the class does not intersect with the original class?
Are there any decision complexity classes which have no complete subclass?
complexity theory;reductions