## Theory of Computation

Theory of Computation. Instructor: Prof. Raghunath Tewari, Department of Computer Science and Engineering, IIT Kanpur. This is an introductory course on Theory of Computation intended for undergraduate students in computer science. In this course we will introduce various models of computation and study their power and limitations. We will also explore the properties of the corresponding language classes defined by these models and the relations between them. We will assume the student is comfortable in analytical reasoning and has preferably done a course on Data Structures and Algorithms.
(from **nptel.ac.in**)

Lecture 40 - More on NP-Completeness |

In this lecture we show that the problems Clique and Independent Set are NP-complete by giving polynomial time reductions from 3SAT to Clique and from Clique to Independent Set.

Go to **the Course Home** or watch other lectures: