M
Explanation by: Mr. Dubey
one of the properties of np class problems states that a non-deterministic algorithm is said to be non-deterministic polynomial if the time-efficiency of its verification stage is polynomial.
You must be Logged in to update hint/solution
Related MCQs
Q. Modern Computers are very reliable but they are not
Q. The active data warehouse architecture includes __________
Q. Operators with the same precedence are evaluated in which manner?
Q. …………. is an activity oriented diagram.
Q. ---------- The damage that occurs when the program encounters an error.
Discusssion
Login to discuss.