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".
No comments:
Post a Comment