Discussion
Which amongst the following is not an NP-complete problem ?
Answer: D
The one that is not NP-complete is the Halting problem.
The halting problem, deciding whether an arbitrary program halts on a given input, is undecidable: no algorithm solves it at all. An NP-complete problem must lie in NP, which means it is decidable and its solutions can be checked in polynomial time.
CNF satisfiability (the first problem proved NP-complete, by Cook), the clique decision problem and the node (vertex) cover decision problem are all classic NP-complete problems.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development