already known NP-complete problem
- SAT
- 1SAT is trivial
- 2SAT is in P
- 3SAT is proven to be NP-complete
- +3SAT are proven to be convertible to 3SAT, therefore NP-complete
- INDSET (maximum independent set)
- CLIQUE (maximum fully connected set)
- SUBSETSUM (Subset Sum)
- ILP (Integer Linear Programming)