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. is a loss in the purchasing power of money over time.
Q. An alternative to JavaScript on windows platform is
Q. Functional testing is known as:
Q. Which of the following was one of the top 5 cloud applications in 2010?
Q. A specialist in charge of the database of an organization select the best fit for answer
Q. A variable which is declared inside a method is called a________variable
Discusssion
Login to discuss.