A

Admin • 831.35K Points
Coach

Q. is the class of decision problems that can be solved by non- deterministic polynomial algorithms?

  • (A) np
  • (B) p
  • (C) hard
  • (D) complete
Explanation by: Admin
np problems are called as non- deterministic polynomial problems. they are a class of decision problems that can be solved using np algorithms.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.