A

Admin • 802.91K Points
Coach

Q. A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
Explanation by: Admin
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

Discusssion

Login to discuss.

Be the first to start discuss.