Q59
In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and NP-hard. What does NP mean?
A.
Non Polynomial time
B.
Non-deterministic Probabilistic
C.
Non-deterministic Polynomial time
AnswerD.
Non Probabilistic time
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board