Which of the following problems is not NP complete?
|Answer» D. halting problem|
|Explanation: hamiltonian circuit, bin packing, partition problems are np complete problems. halting problem is an undecidable problem.|
Login to Continue
It will take less than 2 minutes