show/hide this revision's text 2 edited tags
show/hide this revision's text 1

Characterize P^NP

What can you say about the complexity class P^NP, i.e. decision problems solvable by a polytime TM with an oracle for SAT?

Obviously P^NP is in PH somewhere between NP union coNP, and Sigma2 intersect Pi2. What else is known about that complexity class?