Theory of Computation: Lecture 24. The main topics covered in this lesson include: the class NP; verifiers and alternate characterization of NP like hampath, clique, subset sum problem; another characterization of the class NP; P vs. NP question; Cook-Levin theorem (statement only); polynomial time reducibility; . |