[3]An in-depth study of the classes P and NP, along with the concepts of reducibility and completeness. NPcomplete problems are surveyed, and reduction techniques are examined in greater detail. An important goal is to develop skill at proving problems NP-complete. Prerequisite: Prerequisite: CMSC 641 or consent of instructor.
