M
Q. Which of the following problems is not NP complete?
Explanation by: Mr. Dubey
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
Be the first to start discuss.
Question analytics

Discusssion
Login to discuss.