Q500
. . . . . . . . is the class of decision problems that can be solved by non-deterministic polynomial algorithms.
A.
NP
AnswerB.
P
C.
Hard
D.
Complete
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board