8.2.1. NP Complete Problems, NP Completeness and Reducibility, Cooks Theorem, Proofs of NP Completeness (CNF-SAT, Vertex Cover and Subset Sum) Verbal Notes | Design and Analysis of Algorithm BSC-CSIT | TU | TABFlux