NPC problem example (1)

1. SAT problem (SATISFIABILITY)
[Judging whether the conjunction paradigm (the conjunction of a finite number of simple disjunctions) can be satisfied]
Determine whether the disjunctive paradigm (the disjunction of a limited number of simple conjunctions) is a permanent true form
2.0 -1 integer programming (0-1 INTEGERPROGRAMMING)
3. Minimum point coverage (NODE COVER)
4. SET COVERING (SET COVERING)
5. Graph coloring number (CHROMATICNUMBER)
For graph G, determine whether there is k coloring, and make adjacent nodes color different.
6.0-1 Backpack (KNAPSACK)