A Brief Discussion for NP.docVIP

A Brief Discussion for NP-complete Problem Decision problem: a problem whose solution is simply “yes” or “no”. Optimization problem: a problem that searches for a solution with maximum or minimum value Example: Traveling salesperson problem Knapsack problem Bin Packing problem Clique problem In general, optimization problems are more difficult to solve than their corresponding decision problems. In discussing NP problems, we shall discuss only decision problems Computation Model: Turing Machine Computation Model: 一般電腦 Non-deterministic computation model: Guessing: 如果問題有解答，則一定會猜到解答