Click to edit Master title styleClick to edit Master text stylesSecond levelThird levelFourth levelFifth levelNP The Theory of NPpletenessTractable and intractable problemsNPplete problems1The

Cooks TheoremThe Foundation of NPpletenessTheoretical FoundationsAn alphabet ?={s1s2 … sk} is a set of symbolsThe set ? is the set of all strings created using the symbols of ?.A problem is a su