Q295
A non-deterministic algorithm is said to be non-deterministic polynomial if the time-efficiency of its verification stage is polynomial.
A.
true
AnswerB.
false
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board