 S2P (complexity)

In computational complexity theory, S is a complexity class, intermediate between the first and second levels of the polynomial hierarchy.A language is in formula_1 if there exists a polynomial-time predicate "P" such that

where size of "y" and "z" must be polynomial of "x".