Can you help me understand the class of problems solvable by a nondetermimistic Turing machine with an oracle for SAT running in polynomial time?
How can one characterize NP^SAT?
Liron
- 213
- 2
- 9