What is an $NP^{NP}$-complete problem? [duplicate]
-
02-11-2019 - |
Question
This question already has an answer here:
- What does $A^B$ mean? 1 answer
So in this paper I'm reading (https://adamsmith.as/papers/fdg2013_shortcuts.pdf), the authors talk about an $NP^{NP}$-complete problem, in relation to Answer Set Programming. I know what P, NP, etc. are but I don't unerstand what they mean with $NP^{NP}$. Also I can't Google it because Google doesn't recognize superscript.
I did find out it's also mentioned in this book, but they still don't provide an explanation.
Can anyone ecplain this class of problems to me?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange