The class of problems for which there exists a polynomial-time predicate P(x,y,z) such that for all x, if the answer on input x is "yes," then
Contained in Σ2P and Π2P.
Defined in [Can96], where it was also observed that Φ2P = S2P.
No class.