A

Admin • 833K Points
Coach

Q. Which of the following problems is not NP complete?

  • (A) hamiltonian circuit
  • (B) bin packing
  • (C) partition problem
  • (D) halting problem

Explanation by: Admin

hamiltonian circuit, bin packing, partition problems are np complete problems. halting problem is an undecidable problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.