Complexity Class
The decision problems of the form , where the have size polynomial in and is decidable in polynomial time. Equivalently, the problems solvable in with a oracle. These are the complements of the problems in .
Reference
Stockmeyer, L.J. (1976). The Polynomial-Time Hierarchy. Theoretical Computer Science, 3(1), pp. 1–22.