Lecture 37

Learning objectives

After this class, you should be able to:

1. Given a language, prove that it is in NP by giving details of the Turing machine, the encoding of the problem, and time complexity.

Reading assignment

1. Section 14.5.
2. Lecture 37 slides on Blackboard.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 14.5, exercise #3.
  2. Section 14.5, exercise #5.

• Questions on next lecture's material
  1. None.

---

Last modified: 15 Apr 2014