S4 CSE (Semester 4 - Computer Science and Engineering)
CS010 406 Theory of Computation
Mahatma Gandhi University, Kerala - B.Tech
TOC - Module V - Syllabus
Complexity classes- Tractable problems– Class P –P Complete-Reduction problem - Context grammar nonempty-Intractable problems- Class NP – NP Complete- Cooks theorem-Reduction problems-SAT-Clique-Hamiltonian-TSP-Vertex Cover-NP Hard problems.

DOWNLOAD FROM HERE



See this too (related posts)..

Theory of Computation Lecture Notes - Module 4
Theory of Computation Lecture Notes - Module 3
Theory of Computation Lecture Notes - Module 2
Theory of Computation Lecture Notes - Module 1

TOC MG University (S7) Old Scheme Lecture Notes