Comments on NP-completeness proofs
- hardest part -- choosing a good problem from which to do reduction
- must do reduction from arbitrary instance
- common error -- backwards reduction. Remember that you are using your problem as a black box for solving known NPC problem
- freedom in reduction: if problem includes parameter, can set it in a convenient way
- size of problem can change as long as it doesn’t increase by more than polynomial