Which of the following problems is not NP complete?
(a) Hamiltonian circuit
(b) Bin packing
(c) Partition problem
(d) Halting problem
The question was posed to me during an interview for a job.
I'd like to ask this question from Checksum, Complexity Classes & NP Complete Problems in portion Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II