C, but C may have other complete problems as well.

An example of this is the complexity class defined from the existential theory of the reals, a computational problem that is known to be '''NP'''-hard and in PSPACE, but is not known to be complete for NP, PSPACE, or any language in the polynomial hierarchy. is the set of problems having