In: Computer Science
Can all problems in Karp 21 be solved using an Exhaustive search or Brute force? And why
Karp 21 Problems :
The Karps 21 is a set of problem statements which are np-complete problems.NP-complete means that set of all decision problems whose solutions can be verified in polynomial time; NP may be equivalently defined as the set of decision problems that can be solved in polynomial time on a non-deterministic Turing machine.They are developed by Richard Karp and Steven Cook.
Can all problems in karp 21 be solved by Exhaustive search or Brut force?
The answer to this question is YES.The reason is that, we know karp 21 is an NP-complete problem.So, it will only be an NP-complete problem when it can be solved by a restricted class of Brute force algorithm.This one of the main feature of NP-complete problems.We also know exhaustive search is simply a brute force approach to combinatorial problem.
So all the problems in karp 21 can be solved by using Exhaustive Search or Brute force.