0
$\begingroup$

Can you help me understand the class of problems solvable by a nondetermimistic Turing machine with an oracle for SAT running in polynomial time?

$\endgroup$
3
$\begingroup$

Surely this class, being NP^NP, is by definition equal to Sigma2. In particular, if PH does not collapse, then it does not contain Pi2.

$\endgroup$
  • $\begingroup$ Yes you are obviously right, I actually got confused with another question I meant to ask instead about P^NP. $\endgroup$ – Liron Oct 23 '09 at 23:09
2
$\begingroup$

Yes, NP^SAT = NP^NP, because SAT is complete for NP. I don't know what else can be said about this class (it's not in the complexity zoo). See the wikipedia oracle page for more details.

By the way, the above "computer" tag is not very relevant, it should rather be "complexity", or "complexity-theory".

$\endgroup$
0
$\begingroup$

Isn't that class NP^NP?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.