| Module Name | Download |
|---|
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Lecture 1: Introduction | Download |
| 2 | Lecture 2: NP Completeness | Download |
| 3 | Lecture 3: SAT is NP-complete | Download |
| 4 | Lecture 4: More on NP completeness | Download |
| 5 | Lecture 05: Hierarchy Theorems | Download |
| 6 | Lecture 06: Introduction to Space Complexity | Download |
| 7 | Lecture 07: Savitch’s Theorem | Download |
| 8 | Lecture 08: Immerman-Szelepscenyi Theorem | Download |
| 9 | Lecture 09: Polynomial Hierarchy | Download |
| 10 | Lecture 10: A PSPACE Complete Problem | Download |
| 11 | Lecture 11: More on Polynomial Hierarchy | Download |
| 12 | Lecture 12: Alternating Turing Machines | Download |
| 13 | Lecture 13: Equivalence of Quantifier and Oracle Based Definitions of Polynomial Hierarchy | Download |
| 14 | Lecture 14: Boolean Circuits | Download |
| 15 | Lecture 15: Shannon’s Theorem and Karp-Lipton-Sipser Theorem | Download |
| 16 | Lecture 16: Bounded Depth Circuit Classes | Download |
| 17 | Lecture 17: Kannan’s Theorem | Download |
| 18 | Lecture 18: Probabilistic Complexity | Download |
| 19 | Lecture 19: StrongBPP and WeakBPP | Download |
| 20 | Lecture 20: One-sided and Zero-sided Error Probabilistic Complexity Classes | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Lecture 1: Introduction | PDF unavailable |
| 2 | Lecture 2: NP Completeness | PDF unavailable |
| 3 | Lecture 3: SAT is NP-complete | PDF unavailable |
| 4 | Lecture 4: More on NP completeness | PDF unavailable |
| 5 | Lecture 05: Hierarchy Theorems | PDF unavailable |
| 6 | Lecture 06: Introduction to Space Complexity | PDF unavailable |
| 7 | Lecture 07: Savitch’s Theorem | PDF unavailable |
| 8 | Lecture 08: Immerman-Szelepscenyi Theorem | PDF unavailable |
| 9 | Lecture 09: Polynomial Hierarchy | PDF unavailable |
| 10 | Lecture 10: A PSPACE Complete Problem | PDF unavailable |
| 11 | Lecture 11: More on Polynomial Hierarchy | PDF unavailable |
| 12 | Lecture 12: Alternating Turing Machines | PDF unavailable |
| 13 | Lecture 13: Equivalence of Quantifier and Oracle Based Definitions of Polynomial Hierarchy | PDF unavailable |
| 14 | Lecture 14: Boolean Circuits | PDF unavailable |
| 15 | Lecture 15: Shannon’s Theorem and Karp-Lipton-Sipser Theorem | PDF unavailable |
| 16 | Lecture 16: Bounded Depth Circuit Classes | PDF unavailable |
| 17 | Lecture 17: Kannan’s Theorem | PDF unavailable |
| 18 | Lecture 18: Probabilistic Complexity | PDF unavailable |
| 19 | Lecture 19: StrongBPP and WeakBPP | PDF unavailable |
| 20 | Lecture 20: One-sided and Zero-sided Error Probabilistic Complexity Classes | PDF unavailable |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |