1 votes 1 votes Which of the following problem is not $\text{NP}$ complete but undecidable? Partition Problem Halting Problem Hamiltonian Circuit Bin Packing Theory of Computation nielit-sta-2020 theory-of-computation p-np-npc-nph + – gatecse asked Dec 9, 2020 • recategorized Jul 5, 2022 by Lakshman Bhaiya gatecse 480 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option B reference:- https://stackoverflow.com/questions/10494133/relationship-between-np-hard-and-undecidable-problems#:~:text=An%20NP-hard%20is%20a,i.e.%20solvable%20in%20polynomial%20time). Asim Siddiqui 4 answered Mar 12, 2021 Asim Siddiqui 4 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The halting problem is NP-Hard, not NP-Complete, but is undecidable. Hamiltonian circuit, bin packing, partition problems are NP-complete problems... option B) Halting Problem .. https://en.wikipedia.org/wiki/Halting_problem Pramod k answered Aug 16, 2022 Pramod k comment Share Follow See all 0 reply Please log in or register to add a comment.
